TY - GEN
T1 - Efficient decoding of the Gosset, Coxeter-Todd and the Barnes-Wall lattices
AU - Ran, M.
AU - Snyders, J.
PY - 1998
Y1 - 1998
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=0038564862&partnerID=8YFLogxK
U2 - 10.1109/ISIT.1998.708678
DO - 10.1109/ISIT.1998.708678
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:0038564862
SN - 0780350006
SN - 9780780350007
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 92
BT - Proceedings - 1998 IEEE International Symposium on Information Theory, ISIT 1998
T2 - 1998 IEEE International Symposium on Information Theory, ISIT 1998
Y2 - 16 August 1998 through 21 August 1998
ER -