RUS  ENG
Full version
JOURNALS // Problemy Peredachi Informatsii // Archive

Probl. Peredachi Inf., 2007 Volume 43, Issue 2, Pages 34–51 (Mi ppi10)

This article is cited in 13 papers

Coding Theory

On New Completely Regular $q$-ary Codes

V. A. Zinov'eva, J. Rifàb

a A. A. Kharkevich Institute for Information Transmission Problems, Russian Academy of Sciences
b Universitat Autònoma de Barcelona

Abstract: 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 $\rho=4$ and intersection array $(20,18,4,1;1,2,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.

UDC: 621.391.15

Received: 24.08.2006


 English version:
Problems of Information Transmission, 2007, 43:2, 97–112

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2026