PANG Binbin, ZHU Shixin, SUN Zhonghua, “On Cyclic Codes with Length 2pe over Finite Fields,” Chinese Journal of Electronics, vol. 29, no. 4, pp. 672-677, 2020, doi: 10.1049/cje.2020.05.012
Citation: PANG Binbin, ZHU Shixin, SUN Zhonghua, “On Cyclic Codes with Length 2pe over Finite Fields,” Chinese Journal of Electronics, vol. 29, no. 4, pp. 672-677, 2020, doi: 10.1049/cje.2020.05.012

On Cyclic Codes with Length 2pe over Finite Fields

doi: 10.1049/cje.2020.05.012
Funds:  This work is supported by the National Natural Science Foundation of China (No.61772168, No.61572168) and the Natural Science Foundation of Anhui Province (No.1708085QA01, No.2008085QA04).
  • Received Date: 2019-06-17
  • Rev Recd Date: 2020-01-10
  • Publish Date: 2020-07-10
  • Cyclic codes are an important class of linear codes. Cyclic codes are applied in data storage, communication systems and consumer electronics due to their efficient encoding and decoding algorithms. We utilize the cyclotomy of order 2 to study the cyclic codes with length n=2pe and dimension k=n/2=pe. The cyclic codes from our construction are either optimal or almost optimal among all cyclic codes with the same length and dimension. We get the enumeration of these cyclic codes and study the hull of cyclic codes of length n over Fq. We obtain the range of =dim(Hull(C)). Finally, we construct and enumerate cyclic codes of length n having hull of given dimension.
  • loading
  • S. K. Arora and M. Pruthi, “Minimal cyclic codes of length 2pn”, Finite Fields Their Appl., Vol.5, No.2, pp.177-187, 1999.
    S. Batra and S. K. Arora, “Some cyclic codes of length 2pn”, Des. Codes Cryptogr, Vol.61, No.1, pp.41-69, 2011.
    G. K. Bakshi, V. C. Dumir and M. Raka, “Minimal cyclic codes of length 2m”, Ranchi Univ. Math. J., Vol.33, pp.1-18, 2002.
    G. K. Bakshi and M. Raka, “Minimal cyclic codes of length pnq”, Finite Fields Their Appl., Vol.9, No.4, pp.432-438, 2003.
    M. J. Shi, D. T. Huang, L. Sok, et al., “Double circulant LCD codes over Z4”, Finite Fields and Their Appl., Vol.58, pp.133-144, 2019.
    M. J. Shi, L. Q. Qian and P. Solé, “On self-dual negacirculant codes of index two and four”, Des. Codes Cryptogr., Vol.86, pp.2485-2494, 2018.
    M. J. Shi and Y. P. Zhang, “Quasi-twisted codes with constacyclic constituent codes”, Finite Fields and Their Appl., Vol.39, pp.159-178, 2016.
    L. Sok, M. J. Shi and P. Solé, “Construction of optimal LCD codes over large finite fields”, Finite Fields and Their Appl., Vol.50, pp.138-153, 2018.
    C. F. Gauss, Disquisitiones Arithmeticae, Leipzig, Germany, 1801, and English translation, New Haven, CT: Yale Univ. Press, 1966.
    L. D. Baumert, Cyclic Difference Sets, Lecture Notes in Mathematics, New York: Springer-Verlag, 1971.
    C. S. Ding and H. Niederreiter, “Cyclotomic linear codes of order 3”, IEEE Trans. Inf. Theory, Vol.53, No.6, pp.2274-2277, 2007.
    C. S. Ding and C. P. Xing, “Cyclotomic optical orthogonal codes of composite lengths”, IEEE Trans. Inf. Theory, Vol.52, No.2, 263-268, 2004.
    P. K. Kewat and P. Kumari, “Cyclic codes from the second class two-prime Whiteman's generalized cyclotomic sequence with order 6”, Cryptogr. Commun., Vol.9, No.4, pp.475-499, 2017.
    T. Storer, Cyclotomy and Difference Sets, Chicago, IL: Markham, 1967.
    C. S. Ding and V. Pless, “Cyclotomy and duadic codes of prime lengths”, IEEE Trans. Inf. Theory, Vol.45, No.2, pp.453-466, 1999.
    C. S. Ding and T. Helleseth, “New generalized cyclotomy and its applications”, Finite Fields Their Appl., Vol.4, No.2, pp.140-166, 1998.
    C. S. Ding and T. Helleseth, “Generalized cyclotomic codes of length p1e1…ptet”, IEEE Trans. Inf. Theory, Vol.45, No.2, pp.467-474, 1999.
    C. S. Ding, “Cyclotomic constructions of cyclic codes with length being the product of two primes”, IEEE Trans. Inf. Theory, Vol.58, No.4, pp.2231-2236, 2012.
    M. S. Xiong, “On cyclic codes of composite length and the minimum distance”, IEEE Trans. Inf. Theory, Vol.64, No.9, pp.6305-6314, 2018.
    D. Ghinelli, J. D. Key and T. P. McDonough, “Hulls of codes from incidence matrices of connected regular graphs”, Des. Codes Cryptogr., Vol.70, No.1-2, pp.35-54, 2014.
    J. Leon, “Computing automorphism groups of error-correcting codes”, IEEE Trans. Inf. Theory, Vol.28, No.3, pp.496-511, 1982.
    J. Leon, “Permutation group algorithms based on partition, I: theory and algorithms”, J. Symbolic Comput., Vol.12, pp.533-583, 1991.
    C. J. Li and P. Zeng, “Constructions of linear codes with onedimensional hull”, IEEE Trans. Inf. Theory, Vol.65, No.3, pp.1668-1676, 2019.
    N. Sendrier, “On the dimension of the hull”, SIAM J. Discrete Math., Vol.10, No.2, pp.282-293, 1997.
    N. Sendrier, “Finding the permutation between equivalent codes: The support splitting algorithm”, IEEE Trans. Inf. Theory, Vol.46, No.4, pp.1193-1203, 2000.
    G. Skersys, “The average dimension of the hull of cyclic codes”, Discrete Appl. Math., Vol.128, No.1, pp.275-292, 2003.
    E. Sangwisut, S. Jitman, S. Ling, et al., “Hulls of cyclic and negacyclic codes over finite fields”, Finite Fields Appl., Vol.33, pp.232-257, 2015.
    G. J. Luo, X. W. Cao and X. J. Chen, “MDS codes with hull of arbitrary dimensional and their quantum error correction”, IEEE Trans. Inf. Theory, Vol.65, No.5, pp.2944-2952, 2019.
    C. Ko and Q. Sun, Number Theory Lecture, Higher Education Press, China, 2012.
    T. M. Apostol, Introduction to Analytic Number Theory, New York: Springer-Verlag, 1976.
  • 加载中

Catalog

    通讯作者: 陈斌, bchen63@163.com
    • 1. 

      沈阳化工大学材料科学与工程学院 沈阳 110142

    1. 本站搜索
    2. 百度学术搜索
    3. 万方数据库搜索
    4. CNKI搜索

    Article Metrics

    Article views (515) PDF downloads(129) Cited by()
    Proportional views
    Related

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return