By Topic

More efficient bounded-distance decoding of the Golay code and the Leech lattice

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Feng-Wen Sun ; Dept. of Math. & Comput. Sci., Eindhoven Univ. of Technol., Netherlands ; Van Tilborg, H.C.A.

New multilevel constructions of the Leech lattice and the Golay code are presented. They are derived from Turyn's constructions and the `holy construction' with the octacode as the glue code. Further, we show that the `holy construction' of the Leech lattice with the octacode as the glue code is essentially different from the permuted Turyn construction, although both constructions rely on the octacode. Based on these structures, more efficient bounded-distance decoding algorithms of the Golay code and the Leech lattice are presented

Published in:

Information Theory, 1994. Proceedings., 1994 IEEE International Symposium on

Date of Conference:

27 Jun-1 Jul 1994