On completely regular and completely transitive supplementary codes
Given a parity-check matrix Hm 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 o...
| Autores: | , , |
|---|---|
| Tipo de recurso: | artículo |
| Fecha de publicación: | 2020 |
| País: | España |
| Institución: | Universitat Autònoma de Barcelona |
| Repositorio: | Dipòsit Digital de Documents de la UAB |
| Idioma: | inglés |
| OAI Identifier: | oai:ddd.uab.cat:307321 |
| Acceso en línea: | https://ddd.uab.cat/record/307321 https://dx.doi.org/urn:doi:10.1016/j.disc.2019.111732 |
| Access Level: | acceso abierto |
| Palabra clave: | Completely regular codes Completely transitive codes Hamming codes |
| Sumario: | Given a parity-check matrix Hm 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. |
|---|