Constant 2-labellings and an application to \((r, a, b)\)-covering codes

DOI10.7151/dmgt.1973zbMath1375.05183arXiv1211.5326OpenAlexW4299522987MaRDI QIDQ2409782

Élise Vandomme, Sylvain Gravier

Publication date: 13 October 2017

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1211.5326

zbMATH Keywords

covering codesinfinite gridweighted codesvertex-weighted graphs.

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Infinite graphs (05C63)

Cites Work

• Weighted codes in Lee metrics
• On periodicity of generalized two-dimensional infinite words
• On perfect Lee codes
• Variations on tilings in the Manhattan metric
• On multiple coverings of the infinite rectangular grid with balls of constant radius
• \((a,b)\)-codes in \(\mathbb Z/n\mathbb Z\)
• Perfect codes in graphs
• Weighted coverings and packings
• Perfect Codes in the Lee Metric and the Packing of Polyominoes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Constant 2-labellings and an application to \((r, a, b)\)-covering codes