Decoding q-ary lattices in the Lee metric

2011 IEEE Information Theory Workshop, ITW 2011

Volumn , Issue , 2011, Pages 220-224

  De Campello Jr , Antonio C ^a   Jorge, Grasiele C ^a   Costa, Sueli I R ^a  

^a UNIVERSITY OF CAMPINAS   (Brazil)

Author keywords

[No Author keywords available]

Indexed keywords

DECODING PROCESS; LEE METRIC; LEE SPHERE; Q-ARY CODES; SPHERE DECODING;

INFORMATION THEORY; SPHERES;

DECODING;

EID: 83655191143     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ITW.2011.6089382     Document Type: Conference Paper

References (21)

1. Aibdaiwi B., Horak P., Milazzo L. Enumerating and decoding perfect linear Lee codes, Designs, Codes and Cryptography (2009).
2. Andrade A. A., Interlando J. C., Palazzo J. R. R. Alternant and BCH codes over certain rings, Computational and Applied Mathematics, Vol. 22, pp. 233-247, (2003).
3. Banihashemi A. H., Blake, I. F. Trellis complexity and minimal trellis diagrams of lattices, IEEE Transactions on Information Theory, Vol. 44, pp. 1829-1847, (1998)
4. Conway J. H. and Sloane N. J. A. Sphere packings, lattices and groups. Springer-Verlag, New York, 3rd Ed. (1998).
5. Etzion T. and Yaakobi E., Error-Correction of Multidimensional Bursts, IEEE Trans. Inform. Theory, vol. IT-55, pp. 961976, 2009.
6. Etzion T., Vardy A. and Eitan Y. Dense Error-Correcting Codes in the Lee Metric, IEEE Information Theory Workshop Dublin, Ireland, (2010).
7. Fincke U. and Pohst M., Improved methods for calculating vectors of short length in a lattice, including a complexity analysis Math. Comput., vol. 44, pp. 463471, Apr. 1985.
8. Golomb S. W. and Welch L. R. Perfect Codes in the Lee Metric and the Packing of Polyominoes. SIAM Journal on Applied Mathematics, Vol. 18, No. 2 (March 1970), pp. 302-317.
9. Grell E., Eriksson T., Vardy A., Zeger, K. Closest point search in lattices IEEE Transactions on Information Theory, Vol. 48, pp. 2201-2214(2002).
10. Guo D., Shamai S., Verdú S. Additive Non-Gaussian Noise Channels: Mutual Information and Condition Mean Estimation, IEEE International Symposium on Information Theory, (2005).
11. Hassibi B., Vikalo H. On the Sphere Decoding Algorithm I. Expected Complexity, IEEE Transactions on Signal Processing, vol. 53, no. 8, August, (2005).
12. Horak P., Aibdaiwi B. F. Fast decoding of quasi-perfect Lee distance codes, Designs, Codes and Cryptography (2006).
13. Lee C. Y., Some properties of nonbinary error-correcting code, IRE Trans. Inform. Theory, vol. 4, pp. 72-82, (1958).
14. Lenstra A. K., Lenstra Jr. H. W., and Lovsz. Factoring polynomials with rational coefficients, Math. Ann, 261:515534, 1982.
15. Micciancio D., Regev O. Lattice-Based Cryptography in Post Quantum Cryptography, Bernstein D. J., Buchmann J., Dahmen E. (eds), pp. 147-191, Springer (2009).
16. Micciancio D., Goldwasser S. Complexity of Lattice Problems; A Cryptographic Perspective, The Kluwer International Series in Engineering and Computer Science, vol. 671. Kluwer Academic Publishers, (2002).
17. Roth R. M., Siegel P. H. Lee-Metric BCH Codes and their Application to Constrained and Partial-Response Channels. IEEE Transactions on Information Theory, vol. 40, no. 4, July, (1994).
18. Schnorr C. P. and Euchner M. Lattice basis reduction: improved practical algorithms and solving subset sum problems. Mathematics of Programming, 66:181199, 1994.
19. Rush J. A. and Sloane N. J. A. An improvement to the Minkowski-Hlawka bound for packing superballs, Mathematika, vol. 34(1987), pp. 8-18.
20. Viterbo E., Biglieri E. A universal decoding algorithm for lattice codes, Quatorzieme Colloque Gretsi - Juan-Les-Pins-13-16 September, (1993).
21. Viterbo E., Boutros J. A universal lattice code decoder for fading channels, IEEE Transactions on Information Theory, vol. 45, no. 5, July (1999).