Five families of the narrow-sense primitive BCH codes over finite fields

被引:7
|
作者
Pang, Binbin [1 ,2 ]
Zhu, Shixin [1 ,2 ]
Kai, Xiaoshan [1 ,2 ]
机构
[1] Hefei Univ Technol, Sch Math, Hefei 230009, Anhui, Peoples R China
[2] Intelligent Interconnected Syst Lab Anhui Prov, Hefei, Peoples R China
基金
中国国家自然科学基金;
关键词
Narrow-sense primitive BCH code; Bose distance; Cyclotomic coset; MINIMUM DISTANCE; WEIGHT; BOSE;
D O I
10.1007/s10623-021-00942-z
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
It is an interesting problem to determine the parameters of BCH codes, due to their wide applications. In this paper, we determine the dimension and the Bose distance of five families of the narrow-sense primitive BCH codes with the following designed distances: 1. delta((a,b)) = aq(m)-1/q-1 + bq(m)-1/q2-1, where is even, 0 <= a <= q - 1, 1 <= b <= q - 1, 1 <= a + b <= q - 1 (2). (delta) over tilde ((a,b)) = aq(m-1) + (a + b)q(m-2) - 1, where is even, 0 <= a <= q-1, 1 <= b <= q-1, 1 <= a+b <= q-1. 3. delta((a,c)) = aq(m)-1/q-1 + cq(m-1)-1/q-1, where m >= 2, 0 <= a <= q-1, 1 <= c <= q-1, 1 <= a + c <= q-1. 4. delta((a,t))'=aq(m)-1/q-1 + q(m-1)-1/q-1-t, where m >= 3, 0 <= a <= q-2, a + 2 <= t <= q-1. 5. delta((a,c,t))''=aq(m)-1/q-1 + cq(m-1)-1/q-1-t, where m >= 3, 0 <= a <= q-3, 2 <= c <= q-, 1 <= a+c <= q-1, 1 <= t <= c-1. Moreover, we obtain the exact parameters of two subfamilies of BCH codes with designed distances (delta) over bar = bq(m)-1/q(2)-1 and delta(a,t)=(at+1)qm-1t(q-1) with even m, 1 <= a <= [q-2/t], 1 <= b <= q - 1, t>1 and t vertical bar(q +1). Note that we get the narrow-sense primitive BCH codes with flexible designed distance as to a, b, c, t. Finally, we obtain a lot of the optimal or the best narrow-sense primitive BCH codes.
引用
收藏
页码:2679 / 2696
页数:18
相关论文
共 50 条
  • [21] Some New Quantum BCH Codes over Finite Fields
    Xing, Lijuan
    Li, Zhuo
    ENTROPY, 2021, 23 (06)
  • [22] Two classes of LCD BCH codes over finite fields
    Fu, Yuqing
    Liu, Hongwei
    FINITE FIELDS AND THEIR APPLICATIONS, 2024, 99
  • [23] Families of Convolutional Codes over Finite Fields: A Survey
    Isabel Garcia-Planas, M.
    CODES, CRYPTOLOGY AND INFORMATION SECURITY, C2SI 2017, 2017, 10194 : 17 - 34
  • [24] Blind Recognition of Binary Primitive BCH Codes Based on Polynomial Roots Statistic of Finite Fields
    Zhang, Xinran
    Yang, Xiaojing
    Dai, Yuehua
    PROCEEDINGS OF THE 2015 5TH INTERNATIONAL CONFERENCE ON COMPUTER SCIENCES AND AUTOMATION ENGINEERING, 2016, 42 : 529 - 533
  • [25] Designed distances and parameters of new LCD BCH codes over finite fields
    Fengwei Li
    Qin Yue
    Yansheng Wu
    Cryptography and Communications, 2020, 12 : 147 - 163
  • [26] Designed distances and parameters of new LCD BCH codes over finite fields
    Li, Fengwei
    Yue, Qin
    Wu, Yansheng
    CRYPTOGRAPHY AND COMMUNICATIONS-DISCRETE-STRUCTURES BOOLEAN FUNCTIONS AND SEQUENCES, 2020, 12 (01): : 147 - 163
  • [27] On Nonbinary Quantum Nonprimitive Non-Narrow-Sense BCH Codes
    La Guardia, Giuliano G.
    2012 INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY AND ITS APPLICATIONS (ISITA 2012), 2012, : 450 - 454
  • [28] A new algorithm for finding minimum-weight words in a linear code: Application to McEliece's cryptosystem and to narrow-sense BCH codes of length 511
    Canteaut, A
    Chabaud, F
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1998, 44 (01) : 367 - 378
  • [29] New algorithm for finding minimum-weight words in a linear code: Application to McEliece's cryptosystem and to narrow-sense BCH codes of length 511
    INRIA-Project Codes, Le Chesnay, France
    IEEE Trans Inf Theory, 1 (367-378):
  • [30] Application of soft-decision decoders to non narrow-sense Reed-Solomon codes
    Lee, Soo-Woong
    Kumar, B. V. K. Vijaya
    2007 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, VOLS 1-14, 2007, : 6226 - 6230