About non equivalent completely regular codes with identical intersection array

DOI10.1016/j.endm.2017.02.030zbMath1439.94098OpenAlexW2597218830MaRDI QIDQ1743305

Josep Rifà, Victor A. Zinoviev

Publication date: 13 April 2018

Full work available at URL: http://ddd.uab.cat/record/171006

zbMATH Keywords

completely regular codesdistance regular graphscoset graphs

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Related Items (2)

On new infinite families of completely regular and completely transitive codes ⋮ Minimal binary 2-neighbour-transitive codes

Cites Work

• 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: About non equivalent completely regular codes with identical intersection array