Completely regular codes by concatenating Hamming codes

DOI10.3934/amc.2018021zbMath1414.94943arXiv1703.05929OpenAlexW2602780485WikidataQ130034718 ScholiaQ130034718MaRDI QIDQ1783729

Joaquim Borges, Josep Rifà, Victor A. Zinoviev

Publication date: 21 September 2018

Published in: Advances in Mathematics of Communications (Search for Journal in Brave)

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

zbMATH Keywords

completely regular codescompletely transitive codesconcatenationintersection arrayextended codes

Mathematics Subject Classification ID

Other types of codes (94B60) Combinatorial codes (94B25)

Related Items (4)

On new infinite families of completely regular and completely transitive codes ⋮ On completely regular codes ⋮ On completely regular and completely transitive supplementary codes ⋮ A new distance-regular graph of diameter 3 on 1024 vertices

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Distance-regular graphs
• Completely regular codes with different parameters giving the same distance-regular coset graphs
• On complete regularity of extended codes
• Completely regular codes and completely transitive codes
• On new completely regular \(q\)-ary codes
• Completely regular codes
• Completely transitive codes in Hamming graphs
• The Geometry of Two-Weight Codes
• Generalized t-designs and majority decoding of linear codes
• All nearly perfect codes are known

This page was built for publication: Completely regular codes by concatenating Hamming codes