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

DOI10.1016/j.disc.2017.03.001zbMath1361.05039arXiv1510.06903OpenAlexW2963137458MaRDI QIDQ526258

Victor A. Zinoviev, Josep Rifà

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

zbMATH Keywords

distance-regular graphcompletely regular codecoset 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)

Related Items (2)

On completely regular codes ⋮ Completely regular codes by concatenating Hamming codes

Cites Work

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

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