Weighted perfect codes in Lee metric

DOI10.1016/j.endm.2009.07.079zbMath1273.05034OpenAlexW2045832881MaRDI QIDQ2851506

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

Publication date: 10 October 2013

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

Full work available at URL: https://doi.org/10.1016/j.endm.2009.07.079

zbMATH Keywords

multiple coveringsregular setsLee metricweighted codes

Mathematics Subject Classification ID

Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Combinatorial codes (94B25) Combinatorial aspects of packing and covering (05B40)

Cites Work

• Unnamed Item
• Unnamed Item
• Spectral results on regular graphs with \((k,\tau)\)-regular sets
• 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 perfect codes in Lee metric