Back to Search Start Over

On Cyclic Codes of Composite Length and the Minimum Distance.

Authors :
Xiong, Maosheng
Source :
IEEE Transactions on Information Theory; Sep2018, Vol. 64 Issue 9, p6305-6314, 10p
Publication Year :
2018

Abstract

In an interesting paper, Prof. C. Ding provided three constructions of cyclic codes of length being a product of two primes. Numerical data shows that many codes from these constructions are best cyclic codes of the same length and dimension over the same finite field. However, not much is known about these codes. In this paper, we explain some of the numerical data by developing a general method on cyclic codes of composite length and on estimating the minimum distance. We also provide a general construction of cyclic codes of composite length which are related to Ding’s constructions. Numerical data shows that it produces many best cyclic codes as well. Finally, we point out how these cyclic codes can be used to construct convolutional codes with large free distance. [ABSTRACT FROM AUTHOR]

Details

Language :
English
ISSN :
00189448
Volume :
64
Issue :
9
Database :
Complementary Index
Journal :
IEEE Transactions on Information Theory
Publication Type :
Academic Journal
Accession number :
131346489
Full Text :
https://doi.org/10.1109/TIT.2018.2829763