Single-gaussian messages and noise thresholds for decoding low-density lattice codes

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2009, Pages 734-738

  Kurkoski, Brian M ^a   Yamaguchi, Kazuhiko ^a   Kobayashi, Kingo ^a  

^a UNIVERSITY OF ELECTRO COMMUNICATIONS   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

CHECK NODES; CODE DESIGNS; DECODING ALGORITHM; GAUSSIAN FUNCTIONS; GAUSSIANS; LATTICE CODES; MESSAGE DECODER; MIXTURE OF GAUSSIANS; NOISE THRESHOLDS;

COMPUTATIONAL COMPLEXITY; INFORMATION THEORY;

DECODING;

EID: 70449499332     PISSN: 21578102     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2009.5205680     Document Type: Conference Paper

References (5)

1. N. Sommer, M. Feder, and O. Shalvi, "Low-density lattice codes," IEEE Transactions on Information Theory, vol. 54, pp. 1561-1585, April 2008.
2. B. Kurkoski and J. Dauwels, "Message-passing decoding of lattices using gaussian mixtures," in Proceedings of IEEE International Symposium on Information Theory, (Toronto, Canada), IEEE, July 2008.
3. G. Poltyrev, "On coding without restrictions for the AWGN channel," IEEE Transactions on Information Theory, vol. 40, pp. 409-417, March 1994.
4. T. J. Richardson and R. L. Urbanke, "The capacity of low-density parity check codes under message-passing decoding," IEEE Transactions on Information Theory, vol. 47, pp. 599-618, February 2001.
5. M. C. Davey, Error-correction using low-density parity-check codes. PhD thesis, University of Cambridge, 1999.