1. On Cyclic Codes of Composite Length and the Minimum Distance II.
- Author
-
Xiong, Maosheng and Zhang, Aixian
- Subjects
CYCLIC codes ,HAMMING distance ,LINEAR codes ,MAXIMA & minima ,CONGRUENCES & residues - Abstract
In this paper, we provide two complementary results for cyclic codes of composite length. First, we give a general construction of cyclic codes of length nr from cyclic codes of length n and a lower bound on the minimum distance. Numerical data show that many cyclic codes of composite length with the best parameters can be obtained in this way. Second, in the other direction, we show that for cyclic codes of length n with a primitive n-th root of unity as a non-zero, the minimum distance is roughly bounded by the square-free part of n. This means that we shall not expect good cyclic codes of length n in general if, for example, the length n is divisible by a high power of a prime. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF