Completely regular codes with covering radius 1 and the second eigenvalue in 3-dimensional Hamming graphs

DOI10.1016/j.disc.2024.114296MaRDI QIDQ6646414

Anna A. Taranenko, Ivan Yu. Mogilnykh, Konstantin Vorob'ev

Publication date: 2 December 2024

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

zbMATH Keywords

Hamming graphorthogonal arraycompletely regular codeeigenvalue technique

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Orthogonal arrays, Latin squares, Room squares (05B15) Distance in graphs (05C12)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimum supports of eigenfunctions of Hamming graphs
• On \(q\)-ary linear completely regular codes with \(\rho=2\) and antipodal dual
• To the theory of \(q\)-ary Steiner and other-type trades
• Boolean degree 1 functions on some classical association schemes
• Cycle-balance conditions for distance-regular graphs
• Tight sets and \(m\)-ovoids of generalised quadrangles
• Equitable 2-partitions of the Hamming graphs with the second eigenvalue
• On Lifting Perfect Codes
• On completely regular codes
• On completely regular codes with minimum eigenvalue in geometric graphs
• Perfect 2‐colorings of Hamming graphs
• Spectra of graphs. Theory and application

This page was built for publication: Completely regular codes with covering radius 1 and the second eigenvalue in 3-dimensional Hamming graphs