Applications of coding theory to the construction of modular lattices
Journal of Combinatorial Theory Series A
Codes over \Bbb F_{3} + u\Bbb F_{3} and Improvementsto the Bounds on Ternary Linear Codes
Designs, Codes and Cryptography
| Hi-index | 0.00 |
Oneof the most important problems of coding theory is to constructcodes with best possible minimum distances. In this paper, wegeneralize the method introduced by harada and obtain new codeswhich improve the best known minimum distance bounds of somelinear codes. We have found a new linear ternary code and 8new linear codes over \bbF_{5} with improved minimumdistances. First we introduce a generalized version of Gray map,then we give definition of quasi cyclic codes and introduce nearlyquasi cyclic codes. Next, we give the parameters of new codeswith their generator matrices. Finally, we have included twotables which give Hamming weight enumerators of these new codes.