Completely regular codes by concatenating Hamming codes

DOI10.3934/AMC.2018021MaRDI QIDQ1783729zbMATH OpenOpenAlexWikidataFDO

Authors J. 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 transitive codesconcatenationintersection arraycompletely regular codesextended codes

Mathematics Subject Classification ID

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

Abstract: 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. We also study when the extension of these codes gives completely regular codes. Some of these new codes are completely transitive.

Recommendations

• Completely regular codes and completely transitive codes
• On new completely regular q-ary codes
• New families of completely regular codes and their corresponding distance regular coset graphs
• Completely regular codes
• About non equivalent completely regular codes with identical intersection array

Cites work

• scientific article; zbMATH DE number 3970750 (Why is no real title available?)
• scientific article; zbMATH DE number 3695090 (Why is no real title available?)
• scientific article; zbMATH DE number 43547 (Why is no real title available?)
• scientific article; zbMATH DE number 3480474 (Why is no real title available?)
• scientific article; zbMATH DE number 3497777 (Why is no real title available?)
• scientific article; zbMATH DE number 3499621 (Why is no real title available?)
• scientific article; zbMATH DE number 3521851 (Why is no real title available?)
• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• scientific article; zbMATH DE number 3893212 (Why is no real title available?)
• scientific article; zbMATH DE number 2232233 (Why is no real title available?)
• All nearly perfect codes are known
• Completely regular codes
• Completely regular codes and completely transitive codes
• Completely regular codes with different parameters giving the same distance-regular coset graphs
• Completely transitive codes in Hamming graphs
• Distance-regular graphs
• Generalized t-designs and majority decoding of linear codes
• On complete regularity of extended codes
• On new completely regular q-ary codes
• The Geometry of Two-Weight Codes

Cited in

(9)

• A note on completely regular codes
• About non equivalent completely regular codes with identical intersection array
• On completely regular codes
• On new completely regular q-ary codes
• Completely regular codes and completely transitive codes
• A new distance-regular graph of diameter 3 on 1024 vertices
• On new infinite families of completely regular and completely transitive codes
• Uniqueness of certain completely regular Hadamard codes
• On completely regular and completely transitive supplementary codes

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

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