Fast Bounded-Distance Decoding of the Nordstrom-Robinson Code
- 1 January 1994
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Computing m DFTs over GF(q) with one DFT over GF(q/sup m/)IEEE Transactions on Information Theory, 1993
- Geometrically uniform codesIEEE Transactions on Information Theory, 1991
- A bounded-distance decoding algorithm for the Leech lattice, with generalizationsIEEE Transactions on Information Theory, 1989
- Multilevel codes and multistage decodingIEEE Transactions on Communications, 1989
- Coset codes. II. Binary lattices and related codesIEEE Transactions on Information Theory, 1988
- Fast ML decoding algorithm for the Nordstrom - Robinson code (Corresp.)IEEE Transactions on Information Theory, 1987
- Soft decoding techniques for codes and lattices, including the Golay code and the Leech latticeIEEE Transactions on Information Theory, 1986
- Fast quantizing and decoding and algorithms for lattice quantizers and codesIEEE Transactions on Information Theory, 1982
- A new multilevel coding method using error-correcting codesIEEE Transactions on Information Theory, 1977
- Coding for constant-data-rate systemsTransactions of the IRE Professional Group on Information Theory, 1954