Cyclic codes of length 5p with MDS symbol-pair

被引:1
作者
Li, Fengwei [1 ,2 ]
机构
[1] Nanjing Univ Posts & Telecommun, Coll Sci, Nanjing 210023, Peoples R China
[2] Zaozhuang Univ, Sch Math & Stat, Zaozhuang 277160, Peoples R China
基金
中国国家自然科学基金;
关键词
Symbol-pair code; MDS symbol-pair code; Cyclic code; ROOT CONSTACYCLIC CODES; DISTANCE SEPARABLE CODES; CONSTRUCTIONS;
D O I
10.1007/s10623-023-01184-x
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Let p be a prime with 5|(p - 1). Let S be a set of all repeated-root cyclic codes C = (g(x)), (x(5) - 1)|g(x), of length 5p over a field field F-p, whose Hamming distances are at most 7. In this paper, we present a method to find all maximum distance separable (MDS) symbol-pair codes in S. By this method we can easily obtain the results in Ma and Luo (Des Codes Cryptogr 90:121-137, 2022) and new MDS symbol-pair codes, so we remain two possible MDS symbol-pair codes for readers.
引用
收藏
页码:1873 / 1888
页数:16
相关论文
共 32 条