Weighted codes in Lee metrics
From MaRDI portal
Publication:735023
DOI10.1007/S10623-009-9277-ZzbMATH Open1196.05031OpenAlexW2078676496MaRDI QIDQ735023FDOQ735023
Authors: Paul Dorbec, Sylvain Gravier, Michel Mollard, Iiro 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
Recommendations
- Weighted perfect codes in Lee metric
- Coding for the Lee and Manhattan Metrics With Weighing Matrices
- scientific article; zbMATH DE number 3394010
- scientific article; zbMATH DE number 1756456
- Weight distribution of rank-metric codes
- Concatenated codes for the Lee metric (Corresp.)
- scientific article; zbMATH DE number 3693150
- scientific article; zbMATH DE number 3972792
- Weighted Reed-Muller codes revisited
- On some properties of Lee metric codes.
Coloring of graphs and hypergraphs (05C15) Infinite graphs (05C63) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Combinatorial codes (94B25)
Cites Work
- Perfect codes in graphs
- Title not available (Why is that?)
- Perfect Codes in the Lee Metric and the Packing of Polyominoes
- On multiple coverings of the infinite rectangular grid with balls of constant radius
- Variations on tilings in the Manhattan metric
- Perfect codes in Cartesian products of 2-paths and infinite paths
- Title not available (Why is that?)
- Weighted coverings and packings
Cited In (7)
- Covering codes in Sierpiński graphs
- A survey and classification of Sierpiński-type graphs
- The Weights in MDS Codes
- Coding for the Lee and Manhattan Metrics With Weighing Matrices
- \((a,b)\)-codes in \(\mathbb Z/n\mathbb Z\)
- Constant 2-labellings and an application to \((r, a, b)\)-covering codes
- Weighted perfect codes in Lee metric
This page was built for publication: Weighted codes in Lee metrics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q735023)
