Quasi-perfect Lee distance codes

No abstract is available for this paper.

• Publication year

  2003

• Venue

  IEEE Transactions on Information Theory

• Publication date

  2003-06-01

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1109/TIT.2003.811922
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• On resource placements and fault-tolerant broadcasting in toroidal networks

  1998cited by this paper
• I/O placement strategies and their data locality sensitivities in k/spl times/k toroidal networks

  1997cited by this paper
• Resource placement in torus-based networks

  1996cited by this paper
• In Coding Theory

  1996cited by this paper
• Lee Distance and Topological Properties of k-ary n-cubes

  1995cited by this paper
• Lee-metric BCH codes and their application to constrained and partial-response channels

  1994cited by this paper
• PERFECT DOMINATING SETS

  1990cited by this paper
• On the asymptotic behaviour of Lee-codes

  1984cited by this paper
• Algebraic coding theory

  1984cited by this paper
• Concatenated codes for the Lee metric

  1982cited by this paper
• An Elias-type bound for Lee codes over large alphabets and its application to perfect codes

  1982cited by this paper
• THE LEE-SCHEME AND BOUNDS FOR LEE-CODES

  1982cited by this paper
• Nonexistence Theorems on Perfect Lee Codes over Large Alphabets

  1975cited by this paper
• On Channels and Codes for the Lee Metric

  1971cited by this paper

• Quasi perfect codes in the cartesian product of some graphs

  2025cites this paper
• On Almost Perfect Linear Lee Codes of Packing Radius 2

  2022cites this paper
• PAPR Reduction of Coded Modulation Schemes Using Product Codes over Hexagonal Constellations

  2020cites this paper
• 2-Correcting Lee Codes: (Quasi)-Perfect Spectral Conditions and Some Constructions

  2018cites this paper
• Non-Existence of Linear Perfect Lee Codes With Radius 2 for Infinitely Many Dimensions

  2018cites this paper
• 50 Years of the Golomb–Welch Conjecture

  2017cites this paper
• Perfect and Quasi-Perfect Codes Under the $l_{p}$ Metric

  2017cites this paper
• Quasi-Perfect Lee Codes from Quadratic Curves over Finite Fields

  2016cites this paper
• Quasi-perfect codes in the $$\ell _p$$ℓp metric

  2015cites this paper
• Quasi-perfect codes in the ℓp metric

  2015influential citation
• Quasi-Perfect Lee Codes of Radius 2 and Arbitrarily Large Dimension

  2014cites this paper
• Quasi-Perfect Codes From Cayley Graphs Over Integer Rings

  2013influential citation
• A generalization of Lee codes

  2012cites this paper
• A new approach towards the Golomb-Welch conjecture

  2012cites this paper
• Towards a Solution of the Golomb-Welch Conjecture ?

  2012cites this paper
• WITHDRAWN: Circulant graphs and tessellations on flat tori

  2011cites this paper
• Circulant graphs and tessellations on flat tori

  2010cites this paper
• Error-correcting codes and Minkowski’s conjecture

  2010cites this paper
• On perfect Lee codes

  2009cites this paper
• Enumerating and decoding perfect linear Lee codes

  2009cites this paper
• Códigos y grafos sobre anillos de enteros complejos

  2007cites this paper
• Fast decoding of quasi-perfect Lee distance codes

  2006cites this paper
• Optimal Interleaving on Tori

  2006cites this paper
• User traffic multiplexing on OFDM downlink

  2004cites this paper
• Optimized network data storage and topology control

  2004cites this paper
• Optimal t-interleaving on tori

  2004cites this paper