Quasi-perfect Lee distance codes
From MaRDI portal
Publication:4680116
DOI10.1109/TIT.2003.811922zbMath1063.94089OpenAlexW2145342924MaRDI QIDQ4680116
Publication date: 1 June 2005
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.2003.811922
Related Items (7)
A new approach towards the Golomb-Welch conjecture ⋮ Fast decoding of quasi-perfect Lee distance codes ⋮ A generalization of Lee codes ⋮ Quasi-perfect codes in the \(\ell _p\) metric ⋮ Enumerating and decoding perfect linear Lee codes ⋮ Circulant graphs and tessellations on flat tori ⋮ On perfect Lee codes
This page was built for publication: Quasi-perfect Lee distance codes