Completely regular codes in the n-dimensional rectangular grid

DOI10.33048/SEMI.2022.19.072MaRDI QIDQ6642688zbMATH OpenFDO

Authors Sergey Avgustinovich, A. Yu. Vasil'eva

Publication date 25 November 2024

Published in Sibirskie Elektronnye Matematicheskie Izvestiya (Search for Journal in Brave)

Full work available at URL https://doi.org/10.33048/SEMI.2022.19.072

zbMATH Keywords

\(n\)-dimensional rectangular gridcompletely regular codecovering radiusintersection arrayperfect coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Combinatorial codes (94B25) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)

Recommendations

• Completely regular codes in the infinite hexagonal grid
• Completely regular codes
• Minimum distance bounds for s-regular codes
• About non equivalent completely regular codes with identical intersection array
• Completely regular codes and completely transitive codes

This page was built for publication: Completely regular codes in the \(n\)-dimensional rectangular grid

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6642688)