New Linear Codes Over mathbb{F}_3 and mathbb{F}_5 and Improvements on Bounds |
| |
Authors: | Irfan Siap Dijen K. Ray-Chaudhuri |
| |
Affiliation: | (1) Department of Mathematics, The Ohio State University, USA |
| |
Abstract: | One of the most important problems of coding theory is to constructcodes with best possible minimum distances. In this paper, we generalize the method introduced by [8] and obtain new codes which improve the best known minimum distance bounds of some linear codes. We have found a new linear ternary code and 8 new linear codes over 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. |
| |
Keywords: | Quasi cyclic codes nearly quasi cyclic codes new codes improved bounds |
本文献已被 SpringerLink 等数据库收录! |