Efficient decoding of the Gosset, Coxeter-Todd and the Barnes-Wall lattices

M. Ran, J. Snyders

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Low complexity maximum-likelihood and bounded-distance soft decoding algorithms are presented for several block and lattice codes. The bounded-distance algorithms are based upon multilevel constructions of the codes. To demonstrate the approach, maximum-likelihood and bounded-distance decoders are devised for several well known codes and sphere packings in 8, 12 and 16 dimensions.

Original languageEnglish
Title of host publicationProceedings - 1998 IEEE International Symposium on Information Theory, ISIT 1998
Pages92
Number of pages1
DOIs
StatePublished - 1998
Event1998 IEEE International Symposium on Information Theory, ISIT 1998 - Cambridge, MA, United States
Duration: 16 Aug 199821 Aug 1998

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
ISSN (Print)2157-8095

Conference

Conference1998 IEEE International Symposium on Information Theory, ISIT 1998
Country/TerritoryUnited States
CityCambridge, MA
Period16/08/9821/08/98

Fingerprint

Dive into the research topics of 'Efficient decoding of the Gosset, Coxeter-Todd and the Barnes-Wall lattices'. Together they form a unique fingerprint.

Cite this