Abstract
Binary duadic codes are an interesting subclass of cyclic codes since they have large dimensions and their minimum distances may have a square-root bound. In this paper, we present several families of binary duadic codes of length \(2^m-1\) and develop some lower bounds on their minimum distances by using the BCH bound on cyclic codes, which partially solves one case of the open problem proposed in Liu et al (Finite Field Appl 91:102270, 2023). It is shown that the lower bounds on their minimum distances are close to the square root bound. Moreover, the parameters of the dual and extended codes of these binary duadic codes are investigated.
Similar content being viewed by others
References
Assmus E., Key J.D.: Polynomial codes and finite geometries. In: Pless V.S., Huffman W.C. (eds.) Handbook Coding Theory, vol. 1, pp. 1269–1343. Elsevier, Amsterdam (1998).
Ding C., Ding C.: Cyclotomic constructions of cyclic codes with length being the product of two primes. IEEE Trans. Inf. Theory 58(4), 2231–2236 (2012).
Ding C.: Codes from Difference Sets. World Scientific, Singapore (2018).
Ding C., Lam K., Xing C.: Enumeration and construction of all duadic codes of length \(p^m\). Fundamenta Informaticae 38(1), 149–161 (1999).
Ding C., Pless V.: Cyclotomy and duadic codes of prime lengths. IEEE Trans. Inf. Theory 45(2), 453–466 (1999).
Grassl, M.: Bounds on the minimum distance of linear codes and quantum codes. http://www.codetables.de. Accessed 23 February (2023).
Huffman W.C., Pless V.: Fundamentals of Error-Correcting Codes. Cambridge University Press, Cambridge (2003).
Leon J., Masley J., Pless V.: Duadic codes. IEEE Trans. Inf. Theory 30(5), 709–714 (1984).
Leon J.: A probabilistic algorithm for computing minimum weight of large error-correcting codes. IEEE Trans. Inf. Theory 34(5), 1354–1359 (1988).
Liu H., Li C., Ding C.: Five infinite families of binary cyclic codes and their related codes with good parameters. Finite Field Appl. 91, 102270 (2023).
Pless V.: On weights in duadic codes. J. Comb. Theory Ser. A 44, 6–21 (1987).
Tang C., Ding C.: Binary \([n,(n + 1)/2]\) cyclic codes with good minimum distances. IEEE Trans. Inf. Theory 68(12), 7842–7849 (2022).
Xiong M.: On cyclic codes of composite length and the minimum distance. IEEE Trans. Inf. Theory 64(9), 6305–6314 (2018).
Xiong M., Zhang A.: On cyclic codes of composite length and the minimum distance II. IEEE Trans. Inf. Theory 67(8), 5097–5103 (2021).
Acknowledgements
The authors are very grateful to the reviewers and the editor for their detailed comments and suggestions that much improved the presentation and quality of this paper.
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by J.-L. Kim.
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
The work of Hai Liu and Chengju Li was supported by the National Natural Science Foundation of China (12071138), Shanghai Natural Science Foundation (22ZR1419600), the open research fund of National Mobile Communications Research Laboratory of Southeast University (2022D05). The work of Haifeng Qian was supported by the Innovation Program of Shanghai Municipal Education Commission (2021-01-07-00-08-E00101), and “Digital Silk Road” Shanghai International Joint Lab of Trustworthy Intelligent Software (22510750100).
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Liu, H., Li, C. & Qian, H. Parameters of several families of binary duadic codes and their related codes. Des. Codes Cryptogr. 92, 1–12 (2024). https://doi.org/10.1007/s10623-023-01285-7
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10623-023-01285-7