两类具有两个零点的最优三元循环码
Two Classes of Optimal Ternary Cyclic Codes with Two Zeros
DOI: 10.12677/pm.2024.1410360, PDF,   
作者: 何 潮:四川职业技术学院通识教育学院,四川 遂宁;曾学强:四川轻化大学数学与统计学院,四川 自贡
关键词: 有限域循环码Sphere-Packing界Finite Field Cyclic Code Sphere Packing Bound
摘要: 本文从生成多项式的角度研究具有两个零点的三元循环码。运用有限域上的多变元、因式分解和低次不可约多项式解的结构等数学知识,得到了两类参数为 [ 3 m 1, 3 m 2m1,4 ] 的三元循环码,并关于Sphere-Packing界是紧的。
Abstract: This paper studies ternary cyclic codes with two zeros from the perspective of generating polynomials. By employing mathematical knowledge such as multivariate polynomials over finite fields, factorization, and the structure of solutions for low-degree irreducible polynomials, we obtain two classes of ternary cyclic codes with parameters [ 3 m 1, 3 m 2m1,4 ] . These codes are shown to be tight with respect to the Sphere-Packing bound.
文章引用:何潮, 曾学强. 两类具有两个零点的最优三元循环码[J]. 理论数学, 2024, 14(10): 198-204. https://doi.org/10.12677/pm.2024.1410360

参考文献

[1] Carlet, C., Ding, C. and Yuan, J. (2005) Linear Codes from Perfect Nonlinear Mappings and Their Secret Sharing Schemes. IEEE Transactions on Information Theory, 51, 2089-2102. [Google Scholar] [CrossRef
[2] Ding, C. and Helleseth, T. (2013) Optimal Ternary Cyclic Codes from Monomials. IEEE Transactions on Information Theory, 59, 5898-5904. [Google Scholar] [CrossRef
[3] Li, N., Li, C., Helleseth, T., Ding, C. and Tang, X. (2014) Optimal Ternary Cyclic Codes with Minimum Distance Four and Five. Finite Fields and Their Applications, 30, 100-120. [Google Scholar] [CrossRef
[4] Li, N., Zhou, Z. and Helleseth, T. (2015) On a Conjecture about a Class of Optimal Ternary Cyclic Codes. 2015 Seventh International Workshop on Signal Design and Its Applications in Communications (IWSDA), Bengaluru, 14-18 September 2015, 62-65. [Google Scholar] [CrossRef
[5] Han, D. and Yan, H. (2019) On an Open Problem about a Class of Optimal Ternary Cyclic Codes. Finite Fields and Their Applications, 59, 335-343. [Google Scholar] [CrossRef
[6] Zha, Z. and Hu, L. (2020) New Classes of Optimal Ternary Cyclic Codes with Minimum Distance Four. Finite Fields and Their Applications, 64, Article ID: 101671. [Google Scholar] [CrossRef
[7] Fan, J. and Wang, B. (2022) Two Families of Optimal Ternary Cyclic Codes with Two Zeros. IEEE Access, 10, 72290-72300. [Google Scholar] [CrossRef
[8] Fan, C., Li, N. and Zhou, Z. (2016) A Class of Optimal Ternary Cyclic Codes and Their Duals. Finite Fields and Their Applications, 37, 193-202. [Google Scholar] [CrossRef
[9] Wang, L. and Wu, G. (2016) Several Classes of Optimal Ternary Cyclic Codes with Minimal Distance Four. Finite Fields and Their Applications, 40, 126-137. [Google Scholar] [CrossRef
[10] Zha, Z., Hu, L., Liu, Y. and Cao, X. (2021) Further Results on Optimal Ternary Cyclic Codes. Finite Fields and Their Applications, 75, 101898. [Google Scholar] [CrossRef
[11] Yan, H., Zhou, Z. and Du, X. (2018) A Family of Optimal Ternary Cyclic Codes from the Niho-Type Exponent. Finite Fields and Their Applications, 54, 101-112. [Google Scholar] [CrossRef
[12] Zhou, Z. and Ding, C. (2014) A Class of Three-Weight Cyclic Codes. Finite Fields and Their Applications, 25, 79-93. [Google Scholar] [CrossRef
[13] Liu, Y., Cao, X. and Lu, W. (2023) Two Classes of New Optimal Ternary Cyclic Codes. Advances in Mathematics of Communications, 17, 979-993. [Google Scholar] [CrossRef
[14] He, C., Ran, X. and Luo, R. (2024) Two Classes of Optimal Ternary Cyclic Codes with Minimum Distance Four. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 107, 1049-1052. [Google Scholar] [CrossRef
[15] Wu, G., You, Z., Zha, Z. and Zhang, Y. (2024) Several New Classes of Optimal Ternary Cyclic Codes with Two or Three Zeros. arXiv: 2407.07332.
https://arxiv.org/abs/2407.07332
[16] 李念. 高非线性函数的构造及其在序列编码中的应用[D]: [博士学位论文]. 成都: 西南交通大学, 2014.
[17] 聂浏杰. 几类极小距离为4的三元最优循环码[D]: [硕士学位论文]. 武汉: 湖北大学, 2021.
[18] Lidl, R. and Niederreiter, H. (1996) Finite Fields. 2nd Edition, Cambridge University Press. [Google Scholar] [CrossRef
[19] Huffman, W.C. and Pless, V. (2003) Fundamentals of Error-Correcting Codes. Cambridge University Press. [Google Scholar] [CrossRef