Completely regular codes by concatenating hamming codes

Joaquim Borges, Josep Rifà, Victor Zinoviev

Research output: Contribution to journalArticleResearchpeer-review

3 Citations (Scopus)

Abstract

© 2018 AIMS. We construct new families of completely regular codes by concatenation methods. By combining parity check matrices of cyclic Hamming codes, we obtain families of completely regular codes. In all cases, we compute the intersection array of these codes. As a result, we find some non-equivalent completely regular codes, over the same finite field, with the same parameters and intersection array. We also study when the extension of these codes gives completely regular codes. Some of these new codes are completely transitive.
Original languageEnglish
Pages (from-to)337-349
JournalAdvances in Mathematics of Communications
Volume12
Issue number2
DOIs
Publication statusPublished - 1 Jan 2018

Keywords

  • Completely regular codes
  • Completely transitive codes
  • Concatenation
  • Extended codes
  • Intersection array

Fingerprint Dive into the research topics of 'Completely regular codes by concatenating hamming codes'. Together they form a unique fingerprint.

  • Cite this

    Borges, J., Rifà, J., & Zinoviev, V. (2018). Completely regular codes by concatenating hamming codes. Advances in Mathematics of Communications, 12(2), 337-349. https://doi.org/10.3934/amc.2018021