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

DOI10.1016/J.DISC.2017.03.001zbMATH Open1361.05039arXiv1510.06903OpenAlexW2963137458MaRDI QIDQ526258FDOQ526258

Victor A. Zinoviev, Josep Rifà

Publication date: 10 May 2017

Published in: Discrete Mathematics (Search for Journal in Brave)

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.

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

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
• Families of nested completely regular codes and distance-regular graphs
• Completely regular codes and completely transitive codes

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)

Cites Work

• Title not available (Why is that?)
• Completely regular codes
• Bilinear forms over a finite field, with applications to coding theory
• Title not available (Why is that?)
• Title not available (Why is that?)
• Completely transitive codes in Hamming graphs
• Uniqueness of certain completely regular Hadamard codes
• Completely regular codes and completely transitive codes
• Title not available (Why is that?)
• Characterizing completely regular codes from an algebraic viewpoint
• Title not available (Why is that?)
• New Completely Regular $q$-ary Codes Based on Kronecker Products
• On Lifting Perfect Codes

Cited In (8)

• Title not available (Why is that?)
• On completely regular codes
• Title not available (Why is that?)
• 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
• Completely regular codes by concatenating Hamming codes
• Minimum distance bounds for \(s\)-regular codes
• Distance-regular graphs admitting a perfect 1-code
• 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)