Decoding q-ary lattices in the Lee metric
- 1 October 2011
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 53, 220-224
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
- Fast decoding of quasi-perfect Lee distance codesDesigns, Codes and Cryptography, 2006
- Mutual Information and Minimum Mean-Square Error in Gaussian ChannelsIEEE Transactions on Information Theory, 2005
- 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
- An improvement to the Minkowski‐Hiawka bound for packing superballsMathematika, 1987
- Factoring polynomials with rational coefficientsMathematische Annalen, 1982
- 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