On completely regular and completely transitive supplementary codes

DOI10.1016/J.DISC.2019.111732MaRDI QIDQ2286593zbMATH OpenOpenAlexWikidataFDO

Authors J. Borges, Josep Rifà, Victor A. Zinoviev

Publication date 22 January 2020

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1902.07628

zbMATH Keywords

completely regular codes completely transitive codes Hamming codes

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Abstract: Given a parity-check matrix

H_{m}

of a

q

-ary Hamming code, we consider a partition of the columns into two subsets. Then, we consider the two codes that have these submatrices as parity-check matrices. We say that anyone of these two codes is the supplementary code of the other one. We obtain that if one of these codes is a Hamming code, then the supplementary code is completely regular and completely transitive. If one of the codes is completely regular with covering radius

2

, then the supplementary code is also completely regular with covering radius at most

2

. Moreover, in this case, either both codes are completely transitive, or both are not. With this technique, we obtain infinite families of completely regular and completely transitive codes which are quasi-perfect uniformly packed.

Recommendations

Cites work

Cited in

(1)

On new infinite families of completely regular and completely transitive codes

This page was built for publication: On completely regular and completely transitive supplementary codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2286593)