More results on hulls of some primitive binary and ternary BCH codes

被引:6
作者
Lei, Yinzhao [1 ,2 ]
Li, Chengju [1 ,2 ]
Wu, Yansheng [1 ,3 ]
Zeng, Peng [1 ,2 ]
机构
[1] East China Normal Univ, Shanghai Key Lab Trustworthy Comp, Shanghai 200062, Peoples R China
[2] Southeast Univ, Natl Mobile Commun Res Lab, Nanjing, Peoples R China
[3] Nanjing Univ Posts & Telecommun, Sch Comp Sci, Nanjing 210023, Peoples R China
基金
中国国家自然科学基金;
关键词
BCH code; Cyclic code; Self-orthogonal code; Hull; Cyclotomic coset; MINIMUM DISTANCE; WEIGHT; QUANTUM; BOSE;
D O I
10.1016/j.ffa.2022.102066
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
The (Euclidean) hull of a linear code is defined to be the intersection of the code and its Euclidean dual. It is clear that the hulls are self-orthogonal codes, which are an important type of linear codes due to their wide applications in communication and cryptography. Let C be an [n, k] cyclic code over Fq, where Fq is the finite field of order q. In this paper, we will employ the defining set of the code C to present a general characterization when its hull has dimension k - t. Furthermore, we mainly focus on the primitive q-ary BCH codes C(q,n,delta,b) when b = 0 and b = 1 based on the general characterization. Especially for binary and ternary cases, we will present several sufficient and necessary conditions that the hulls of the codes C(q,n,delta,b) have dimensions k-2 and k-3 by giving lower and upper bounds on their designed distances, which extends the results of [17]. In addition, several classes of binary and ternary self-orthogonal codes are proposed via the hulls of BCH codes and their parameters are investigated in some special cases. (c) 2022 Elsevier Inc. All rights reserved.
引用
收藏
页数:29
相关论文
共 36 条
[1]   On quantum and classical BCH codes [J].
Aly, Salah A. ;
Klappenecker, Andreas ;
Sarvepalli, Pradeep Kiran .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2007, 53 (03) :1183-1188
[2]  
[Anonymous], 1983, The Theory of Error-Correcting Codes
[3]   AFFINE AND PROJECTIVE-PLANES [J].
ASSMUS, EF ;
KEY, JD .
DISCRETE MATHEMATICS, 1990, 83 (2-3) :161-187
[4]   IDEMPOTENTS AND THE BCH BOUND [J].
AUGOT, D ;
SENDRIER, N .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1994, 40 (01) :204-207
[5]   STUDYING THE LOCATOR POLYNOMIALS OF MINIMUM WEIGHT CODEWORDS OF BCH CODES [J].
AUGOT, D ;
CHARPIN, P ;
SENDRIER, N .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1992, 38 (03) :960-973
[6]  
BERLEKAM.ER, 1967, AT&T TECH J, V46, P1861
[7]   Quantum error correction via codes over GF (4) [J].
Calderbank, AR ;
Rains, EM ;
Shor, PW ;
Sloane, NJA .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1998, 44 (04) :1369-1387
[8]   Euclidean and Hermitian LCD MDS codes [J].
Carlet, Claude ;
Mesnager, Sihem ;
Tang, Chunming ;
Qi, Yanfeng .
DESIGNS CODES AND CRYPTOGRAPHY, 2018, 86 (11) :2605-2618
[9]  
Cary Huffman., 2003, Fundamentals of Error-Correcting Codes
[10]   ON A CLASS OF PRIMITIVE BCH-CODES [J].
CHARPIN, P .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1990, 36 (01) :222-229