×

Some binary BCH codes with length \(n = 2^m + 1\). (English) Zbl 1404.94147

Summary: Under research for nearly sixty years, Bose-Chaudhuri-Hocquenghem (BCH) codes have played increasingly important roles in many applications such as communication, data storage and information security. However, the dimension and minimum distance of BCH codes have been seldom solved by now because of their intractable characteristics. The objective of this paper is to study the dimensions of some binary BCH codes with length \(n = 2^m + 1\). Many new techniques are employed to investigate the coset leaders modulo \(n\). For \(m = 2 t + 1, 4 t + 2, 8 t + 4\) and \(m \geq 10\), the first five largest coset leaders modulo \(n\) are determined, and the dimensions of some BCH codes of length \(n\) with designed distance \(\delta > 2^{\lceil \frac{m}{2} \rceil}\) are presented. These new skills and results may be helpful to study other types of cyclic codes over finite fields.

MSC:

94B15 Cyclic codes
11T71 Algebraic coding theory; cryptography (number-theoretic aspects)
14G50 Applications to coding theory and cryptography of arithmetic geometry

References:

[1] Hocquenghem, A., Codes correcteurs d’erreurs, Chiffres (Paris), 2, 147-156, (1959) · Zbl 0090.34608
[2] Bose, R. C.; Ray-Chaudhuri, D. K., On a class of error correcting binary group codes, Inf. Control, 3, 68-79, (1960) · Zbl 0104.36402
[3] Bose, R. C.; Ray-Chaudhuri, D. K., Further results on error correcting binary group codes, Inf. Control, 3, 279-290, (1960) · Zbl 0104.36403
[4] Charpin, P., Open problems on cyclic codes, (Pless, V. S.; Human, W. C.; Brualdi, R. A., Handbook of Coding Theory, Part 1: Algebraic Coding, Chap. 11, (1998), Elsevier: Elsevier Amsterdam, The Netherlands) · Zbl 0927.94017
[5] Mann, H. B., On the number of information symbols in Bose-Chaudhuri codes, Inf. Control, 5, 2, 153-162, (1962) · Zbl 0113.12102
[6] Yue, D.; Hu, Z., On the dimension and minimum distance of BCH codes over \(\mathbf{GF}(q)\), Chin. J. Electron., 13, 3, 216-221, (1996)
[7] Aly, S. A.; Klappenecker, A.; Sarvepalli, P. K., On quantum and classical BCH codes, IEEE Trans. Inf. Theory, 53, 3, 1183-1188, (2007) · Zbl 1310.94195
[8] Ding, C., Codes from Difference Sets, (2015), World Scientific: World Scientific Singapore
[9] Ding, C., Parameters of several classes of BCH codes, IEEE Trans. Inf. Theory, 61, 10, 5322-5330, (2015) · Zbl 1359.94764
[10] Ding, C.; Du, X.; Zhou, Z., The Bose and minimum distance of a class of BCH codes, IEEE Trans. Inf. Theory, 61, 5, 2351-2356, (2015) · Zbl 1359.94686
[11] Ding, C.; Fan, C.; Zhou, Z., The dimension and minimum distance of two classes of primitive BCH codes, Finite Fields Appl., 45, 237-263, (2017) · Zbl 1402.94100
[12] Ding, C., BCH codes in the past 55 years, (The 7th International Workshop on Finite Fields and Their Applications, Tianjin, China, (2016))
[13] Li, S.; Li, C.; Ding, C.; Liu, H., Two families of LCD BCH codes, IEEE Trans. Inf. Theory, 63, 9, 5699-5717, (2017) · Zbl 1374.94845
[14] Li, C.; Ding, C.; Li, S., LCD cyclic codes over finite fields, IEEE Trans. Inf. Theory, 63, 7, 4344-4356, (2017) · Zbl 1370.94585
[15] Liu, H.; Ding, C.; Li, C., Dimensions of three types of BCH codes over \(\mathbb{F}_q\), Discrete Math., 340, 1910-1927, (2017) · Zbl 1422.94051
[16] Macwilliams, F. J.; Sloane, N. J.A., The Theory of Error-Correcting Codes, (1977), North-Holland: North-Holland Amsterdam, the Netherlands · Zbl 0369.94008
[17] Huffman, W. C.; Pless, V., Fundamentals of Error-Correcting Codes, (2003), Cambridge University Press: Cambridge University Press Cambridge · Zbl 1099.94030
[18] Carlet, C.; Guilley, S., Complementary dual codes for counter-measures to side-channel attacks, (Pinto, E. R.; etal., Coding Theory and Applications, CIM Series in Mathematical Sciences, Springer Verlag, vol. 3, (2014)), Adv. Math. Commun., 10, 1, 131-150, (2016) · Zbl 1352.94091
[19] Rao, Y.; Li, R.; Lu, L.; Chen, G.; Zuo, F., On binary LCD cyclic codes, Proc. Comput. Sci., 107, 778-783, (2017)
[20] Pang, B.; Zhu, S.; Sun, Z., On LCD negacyclic codes over finite fields, J. Syst. Sci. Complex., 1-13, (2017)
[21] Liu, Y.; Li, R.; Fu, Q.; Lu, L.; Rao, Y., Some binary BCH codes with length \(n = 2^m + 1\) · Zbl 1404.94147
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.