English

On cyclic codes of length $2^e$ over finite fields

Information Theory 2018-08-21 v1 math.IT

Abstract

Professor Cunsheng Ding gave cyclotomic constructions of cyclic codes with length being the product of two primes. In this paper, we study the cyclic codes of length n=2en=2^e and dimension k=2e1k=2^{e-1}. Clearly, Ding's construction is not hold in this place. We describe two new types of generalized cyclotomy of order two, which are different from Ding's. Furthermore, we study two classes of cyclic codes of length nn and dimension kk. We get the enumeration of these cyclic codes. What's more, all of the codes from our construction are among the best cyclic codes. Furthermore, we study the hull of cyclic codes of length nn over Fq\mathbb{F}_q. We obtain the range of =dim(Hull(C))\ell=\dim({\rm Hull}(C)). We construct and enumerate cyclic codes of length nn having hull of given dimension.

Keywords

Cite

@article{arxiv.1808.06338,
  title  = {On cyclic codes of length $2^e$ over finite fields},
  author = {Binbin Pang and Shixin Zhu and Ping Li},
  journal= {arXiv preprint arXiv:1808.06338},
  year   = {2018}
}
R2 v1 2026-06-23T03:38:03.726Z