On new completely regular q-ary codes

被引:11
作者
Zinoviev, V. A. [1 ]
Rifa, J. [1 ]
机构
[1] RAS, Kharkevich Inst Informat Transmiss Problems, Moscow 117901, Russia
基金
俄罗斯基础研究基金会;
关键词
Codes; (symbols);
D O I
10.1134/S0032946007020032
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
In this paper, new completely regular q-ary codes are constructed from q-ary perfect codes. In particular, several new ternary completely regular codes are obtained from the ternary [11 6; 5] Golay code. One of these codes with parameters [11, 5, 6] has covering radius rho = 5 and intersection array (22, 20, 18, 2, 1; 1, 2, 9, 20, 22). This code is dual to the ternary perfect [11, 6, 5] Golay code. Another [10, 5, 5] code has covering radius p = 4 and intersection array (20, 18, 4, 1; 1, 21 18, 20). This code is obtained by deleting one position of the former code. All together, the ternary Golay code results in eight completely regular codes, only four of which were previously known. Also, new infinite families of completely regular codes are constructed from q-ary Hamming codes.
引用
收藏
页码:97 / 112
页数:16
相关论文
共 18 条
[1]  
[Anonymous], 1971, PROBL INFORM TRANSM
[2]  
[Anonymous], PHILIPS RES REP S
[3]  
Bassalygo L. A., 1975, Problems of Information Transmission, V11, P181
[4]  
Bassalygo L. A., 1974, Problems of Information Transmission, V10, P6
[5]  
Bassalygo L. A., 1977, Problems of Information Transmission, V13, P178
[6]  
BORGES J, 2005, P 4 INT WORKSH OPT C, P32
[7]  
BORGES J, IN PRESS DISCRETE MA
[8]  
BORGES J, 2006, P 10 INT WORKSH ALG, P35
[9]  
Brouwer A.E., 1989, DISTANCE REGULAR GRA
[10]  
GOETHALS JM, 1975, PHILIPS RES REP, V30, P9