Weighted codes in Lee metrics

DOI10.1007/s10623-009-9277-zzbMath1196.05031OpenAlexW2078676496MaRDI QIDQ735023

Paul Dorbec, Michel Mollard, Sylvain Gravier, Iiro S. Honkala

Publication date: 14 October 2009

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-009-9277-z

zbMATH Keywords

coloringgrid graphManhattan metricgraph coloring probleminfinite gridweighted code

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Combinatorial codes (94B25) Infinite graphs (05C63)

Related Items (2)

Constant 2-labellings and an application to \((r, a, b)\)-covering codes ⋮ A survey and classification of Sierpiński-type graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Variations on tilings in the Manhattan metric
• On multiple coverings of the infinite rectangular grid with balls of constant radius
• Perfect codes in graphs
• Perfect codes in Cartesian products of 2-paths and infinite paths
• Weighted coverings and packings
• Perfect Codes in the Lee Metric and the Packing of Polyominoes

This page was built for publication: Weighted codes in Lee metrics