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

Documenti analoghi

• On strong nodal domains for eigenfunctions of Hamming graphs
  di: Valyuzhenich, Alexandr, et al.
  Pubblicazione: (2025)
• On extended perfect codes
  di: Vorob'ev, Konstantin
  Pubblicazione: (2024)
• On binary codes with distances $d$ and $d+2$
  di: Landjev, Ivan, et al.
  Pubblicazione: (2024)
• Completely regular codes in graphs covered by a Hamming graph
  di: Goryainov, Sergey, et al.
  Pubblicazione: (2024)
• An upper bound on the size of a code with $s$ distances
  di: Landjev, Ivan, et al.
  Pubblicazione: (2025)