The extended codes of some linear codes

被引：7
作者：
Sun, Zhonghua [1 ]
Ding, Cunsheng [2 ]
Chen, Tingfang [2 ]
机构：
[1] Hefei Univ Technol, Sch Math, Hefei 230601, Peoples R China
[2] Hong Kong Univ Sci & Technol, Dept Comp Sci & Engn, Kowloon, Clear Water Bay, Hong Kong, Peoples R China
来源：
FINITE FIELDS AND THEIR APPLICATIONS | 2024年 / 96卷
基金：
中国国家自然科学基金;
关键词：
Extended code; Hamming code; Constacyclic code; Cyclic code; Linear code; EXTENSION THEOREM; AUTOMORPHISM-GROUPS; BCH CODES; EXTENDABILITY; BINARY; GCD(D; ARCS;
D O I：
10.1016/j.ffa.2024.102401
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
The classical way of extending an [ n, k, d ] linear code C is to add an overall parity -check coordinate to each codeword of the linear code C . This extended code, denoted by C ( - 1 ) and called the standardly extended code of C , is a linear code with parameters [ n +1, k, d <overline> ], where d <overline> = d or d <overline> = d +1. This is one of the two extending techniques for linear codes in the literature. The standardly extended codes of some families of binary linear codes have been studied to some extent. However, not much is known about the standardly extended codes of nonbinary codes. For example, the minimum distances of the standardly extended codes of the nonbinary Hamming codes remain open for over 70 years. The first objective of this paper is to introduce the nonstandardly extended codes of a linear code and develop some general theory for this type of extended linear codes. The second objective is to study this type of extended codes of a number of families of linear codes, including cyclic codes and nonbinary Hamming codes. Four families of distance -optimal or dimension -optimal linear codes are obtained with this extending technique. The parameters of certain extended codes of many families of linear codes are settled in this paper. (c) 2024 Elsevier Inc. All rights reserved.
引用
收藏
页数：44
相关论文
共 53 条
[1]   Extended cyclic codes, maximal arcs and ovoids [J].
Abdukhalikov, Kanat ;
Ho, Duy .
DESIGNS CODES AND CRYPTOGRAPHY, 2021, 89 (10) :2283-2294
[2]   The automorphism groups of BCH codes and of some affine-invariant codes over extension fields [J].
Berger, TP ;
Charpin, P .
DESIGNS CODES AND CRYPTOGRAPHY, 1999, 18 (1-3) :29-53
[3]   EXTENDED DOUBLE-ERROR-CORRECTING BINARY GOPPA CODES ARE CYCLIC [J].
BERLEKAMP, ER ;
MORENO, O .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1973, 19 (06) :817-818
[4]   ORTHOGONAL ARRAYS OF STRENGTH 2 AND 3 [J].
BOSE, RC ;
BUSH, KA .
ANNALS OF MATHEMATICAL STATISTICS, 1952, 23 (04) :508-524
[5]  
Cheon EJ, 2009, DESIGN CODE CRYPTOGR, V52, P171, DOI 10.1007/s10623-009-9275-1
[6]  
De Boer M. A., 1996, Designs, Codes and Cryptography, V9, P143
[7]   Maximal arcs and extended cyclic codes [J].
De Winter, Stefaan ;
Ding, Cunsheng ;
Tonchev, Vladimir D. .
DESIGNS CODES AND CRYPTOGRAPHY, 2019, 87 (04) :807-816
[8]  
Ding C., 2022, Designs From Linear Codes, V2nd
[9]  
Ding C., 2015, CODES DIFFERENCE SET
[10]   An Infinite Family of Steiner Systems S(2,4,2m) from Cyclic Codes [J].
Ding, Cunsheng .
JOURNAL OF COMBINATORIAL DESIGNS, 2018, 26 (03) :127-144
123456