New upper bounds on Lee codes
From MaRDI portal
Publication:2492226
DOI10.1016/j.dam.2006.01.009zbMath1092.94033MaRDI QIDQ2492226
Publication date: 9 June 2006
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2006.01.009
Related Items
The \(k\)-distance independence number and 2-distance chromatic number of Cartesian products of cycles, The 2-distance coloring of the Cartesian product of cycles using optimal Lee codes, Tilings in Lee metric, On perfect Lee codes, Semidefinite programming bounds for Lee codes, Fundamentals of coding type problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Genetic algorithms in coding theory -- a table for \(A_ 3(n, d)\)
- Upper bounds for constant weight and Lee codes slightly outside the Plotkin range
- Some remarks on the Plotkin bound
- THE LEE-SCHEME AND BOUNDS FOR LEE-CODES
- A modification of the elias-bound and nonexistence theorems for perfect codes in the Lee-metric
- An Elias-type bound for Lee codes over large alphabets and its application to perfect codes (Corresp.)
- Lee metric codes over integer residue rings (Corresp.)
- Fundamentals of Error-Correcting Codes
- An upper bound on minimum distance for a k-ary code
- Error-correcting codes over an alphabet of four elements
- Bounds on codes over an alphabet of five elements