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

M. Ran; J. Snyders

doi:10.1109/ISIT.1998.708678

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

M. Ran, J. Snyders

Department of Electrical Engineering - Systems

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-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 language	English
Title of host publication	Proceedings - 1998 IEEE International Symposium on Information Theory, ISIT 1998
Pages	92
Number of pages	1
DOIs	https://doi.org/10.1109/ISIT.1998.708678
State	Published - 1998
Event	1998 IEEE International Symposium on Information Theory, ISIT 1998 - Cambridge, MA, United States Duration: 16 Aug 1998 → 21 Aug 1998

Publication series

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

Conference

Conference	1998 IEEE International Symposium on Information Theory, ISIT 1998
Country/Territory	United States
City	Cambridge, MA
Period	16/08/98 → 21/08/98

Access to Document

10.1109/ISIT.1998.708678

Cite this

@inproceedings{6e6c4ce991df43c5b77ee742aa741546,

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

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.",

author = "M. Ran and J. Snyders",

year = "1998",

doi = "10.1109/ISIT.1998.708678",

language = "אנגלית",

isbn = "0780350006",

series = "IEEE International Symposium on Information Theory - Proceedings",

pages = "92",

booktitle = "Proceedings - 1998 IEEE International Symposium on Information Theory, ISIT 1998",

note = "null ; Conference date: 16-08-1998 Through 21-08-1998",

}

Ran, M & Snyders, J 1998, Efficient decoding of the Gosset, Coxeter-Todd and the Barnes-Wall lattices. in Proceedings - 1998 IEEE International Symposium on Information Theory, ISIT 1998., 708678, IEEE International Symposium on Information Theory - Proceedings, pp. 92, 1998 IEEE International Symposium on Information Theory, ISIT 1998, Cambridge, MA, United States, 16/08/98. https://doi.org/10.1109/ISIT.1998.708678

Efficient decoding of the Gosset, Coxeter-Todd and the Barnes-Wall lattices. / Ran, M.; Snyders, J.

Proceedings - 1998 IEEE International Symposium on Information Theory, ISIT 1998. 1998. p. 92 708678 (IEEE International Symposium on Information Theory - Proceedings).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

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 - פרסום בספר כנס

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

Y2 - 16 August 1998 through 21 August 1998

ER -

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

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this