Decoding q-ary lattices in the Lee metric
Preprint
Abstract
q-ary lattices can be obtained from q-ary codes using the so-called Construction A. We investigate these lattices in the Lee metric and show how their decoding process can be related to the associated codes. For prime q we derive a Lee sphere decoding algorithm for q-ary lattices, present a brief discussion on its complexity and some comparisons with the classic sphere decoding.Keywords
All Related Versions
This publication has 13 references indexed in Scilit:
- Error-Correction of Multidimensional BurstsIEEE Transactions on Information Theory, 2009
- Enumerating and decoding perfect linear Lee codesDesigns, Codes and Cryptography, 2009
- On the sphere-decoding algorithm I. Expected complexityIEEE Transactions on Signal Processing, 2005
- Additive non-Gaussian noise channels: mutual information and conditional mean estimation2005
- Closest point search in latticesIEEE Transactions on Information Theory, 2002
- Trellis complexity and minimal trellis diagrams of latticesIEEE Transactions on Information Theory, 1998
- Lattice basis reduction: Improved practical algorithms and solving subset sum problemsMathematical Programming, 1994
- Lee-metric BCH codes and their application to constrained and partial-response channelsIEEE Transactions on Information Theory, 1994
- Perfect Codes in the Lee Metric and the Packing of PolyominoesSIAM Journal on Applied Mathematics, 1970
- Some properties of nonbinary error-correcting codesIEEE Transactions on Information Theory, 1958