Abstract
Combinatorial t-designs are closely related to coding theory and finite geometries and have nice applications in some engineering areas. One of the major approaches to the construction of combinatorial t-designs is the employment of error-correcting codes. In this paper, this approach is further investigated with a class of linear codes related to the extended BCH codes and their duals over finite fields. By determining the parameters of these codes, an infinite family of 3-designs is presented and their parameters are also explicitly determined. In addition, the parameters of some combinatorial 2-designs from the extended codes of certain primitive BCH codes are also determined. Moreover, Research Problem 9.4 proposed by Ding in [Designs from Linear Codes, World Scientific, Singapore, pp: 257, 2018)] is also solved.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Ding, C.: Designs from Linear Codes. World Scientific, Singapore (2018)
Ding, C., Tang, C.: Infinite families of near MDS codes holding t-designs. IEEE Trans. Inf. Theory 66(9), 5419–5428 (2020)
Tang, C., Ding, C., Xiong, M.: Codes, differentially δ-uniform functions, and t-designs. IEEE Trans. Inf. Theory 66(6), 3691–3703 (2020)
Tang, C., Ding, C.: An infinite family of linear codes supporting 4-designs. IEEE Trans. Inf. Theory 67(1), 244–254 (2021)
Ding, C., Li, C., Xia, Y.: Another generalization of the binary Reed-Muller codes and its applications. Finite Fields Appl. 53, 144–174 (2018)
Ding, C.: Infinite families of 3-designs from a type of five-weight code. Des. Codes Cryptogr. 86(3), 703–719 (2018)
Ding, C.: An infinite family of Steiner systems from cyclic codes. J. Comb. Des. 26, 127–144 (2018)
Tang, C., Ding, C., Xiong, M.: Steiner systems \(S(2, 4, \frac {3^{m},-1}{2})\) and 2-designs from ternary linear codes of length \(\frac {3^{m}-1}{2}\). Des. Codes Cryptogr. 87(12), 2793–2811 (2019)
Du, X., Wang, R., Tang, C., Wang, Q.: Infinite families of 2-designs from two classes of binary cyclic codes with three nonzeros. Adv. Math. Commun. https://doi.org/10.3934/amc.2020106 (2020)
Du, X., Wang, R., Fan, C.: Infinite families of 2-designs from a class of cyclic codes. J. COMB DES. https://doi.org/10.1002/jcd.21682 (2020)
Acknowledgements
The author is very grateful to the reviewers and the Editor, for their comments and suggestions that improved the presentation and quality of this paper. This paper was supported by the Basic Research Project of Science and Technology Plan of Guangzhou city of China under grant number 202102020888, and the National Natural Science Foundation of China under grant numbers 12171162, 11701187 and 11971175.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher’s note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Xiang, C. Some t-designs from BCH codes. Cryptogr. Commun. 14, 641–652 (2022). https://doi.org/10.1007/s12095-021-00546-3
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s12095-021-00546-3