Completely regular codes with different parameters giving the same distance-regular coset graphs

DOI10.1016/J.DISC.2017.03.001MaRDI QIDQ526258zbMATH OpenOpenAlexFDO

Authors Josep Rifà, Victor A. Zinoviev

Publication date 10 May 2017

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1510.06903, http://ddd.uab.cat/record/171453

zbMATH Keywords

completely regular codedistance-regular graphcoset graphbilinear forms graphcompletely transitive codedistance-transitive graphKronecker product constructionlifting of a fielduniformly packed code

Mathematics Subject Classification ID

Distance in graphs (05C12) Theory of error-correcting codes and error-detecting codes (94B99)

Abstract: A known Kronecker construction of completely regular codes has been investigated taking different alphabets in the component codes. This approach is also connected with lifting constructions of completely regular codes. We obtain several classes of completely regular codes with different parameters, but identical intersection array. Given a prime power $q$ and any two natural numbers $a,b$, we construct completely transitive codes over different fields with covering radius $ho=mina,b$ and identical intersection array, specifically, one code over $F_{q^r}$ for each divisor $r$ of $a$ or $b$. As a corollary, for any prime power $q$, we show that distance regular bilinear forms graphs can be obtained as coset graphs from several completely regular codes with different parameters. Under the same conditions, an explicit construction of an infinite family of $q$-ary uniformly packed codes (in the wide sense) with covering radius $ho$, which are not completely regular, is also given.

Recommendations

• About non equivalent completely regular codes with identical intersection array
• New families of completely regular codes and their corresponding distance regular coset graphs
• scientific article; zbMATH DE number 4104861
• Families of nested completely regular codes and distance-regular graphs
• Completely regular codes and completely transitive codes

Cites work

• scientific article; zbMATH DE number 43547 (Why is no real title available?)
• scientific article; zbMATH DE number 177889 (Why is no real title available?)
• scientific article; zbMATH DE number 3497777 (Why is no real title available?)
• scientific article; zbMATH DE number 3204642 (Why is no real title available?)
• scientific article; zbMATH DE number 2232233 (Why is no real title available?)
• Bilinear forms over a finite field, with applications to coding theory
• Characterizing completely regular codes from an algebraic viewpoint
• Completely regular codes
• Completely regular codes and completely transitive codes
• Completely transitive codes in Hamming graphs
• New Completely Regular $q$-ary Codes Based on Kronecker Products
• On Lifting Perfect Codes
• Uniqueness of certain completely regular Hadamard codes

Cited in

(14)

• On completely regular codes
• Families of nested completely regular codes and distance-regular graphs
• On a conjecture of Martin on the parameters of completely regular codes and the classification of the completely regular codes in the biggs-smith graph
• scientific article; zbMATH DE number 4104861 (Why is no real title available?)
• scientific article; zbMATH DE number 4110626 (Why is no real title available?)
• Completely regular codes in Johnson and Grassmann graphs with small covering radii
• New families of completely regular codes and their corresponding distance regular coset graphs
• Distance-regular graphs admitting a perfect 1-code
• About non equivalent completely regular codes with identical intersection array
• A new distance-regular graph of diameter 3 on 1024 vertices
• Completely regular codes by concatenating Hamming codes
• Arithmetic completely regular codes
• Minimum distance bounds for \(s\)-regular codes
• Yet another distance regular graph related to a Golay code

This page was built for publication: Completely regular codes with different parameters giving the same distance-regular coset graphs

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