Fast Decoding Algorithms for First Order Reed-Muller and Related Codes
Designs, Codes and Cryptography
Ordered Binary Decision Diagrams and Minimal Trellises
IEEE Transactions on Computers
An Algorithm to Compute a Nearest Point in the Lattice An*
AAECC-13 Proceedings of the 13th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Multi-dimensional nested lattice quantization for Wyner-Ziv coding
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Frequency estimation by phase unwrapping
IEEE Transactions on Signal Processing
Distributed locality sensitivity hashing
CCNC'10 Proceedings of the 7th IEEE conference on Consumer communications and networking conference
Linear-time nearest point algorithms for coxeter lattices
IEEE Transactions on Information Theory
A new approach to the information set decoding algorithm
Computer Communications
On the number of lattice points in a small sphere and a recursive lattice decoding algorithm
Designs, Codes and Cryptography
| Hi-index | 754.90 |
Two kinds of algorithms are considered.1)If *** is a binary code of lengthn, a "soft decision" decoding algorithm for *** changes an arbitrary point ofR^{n}into a nearest codeword (nearest in Euclidean distance).2)Similarly, a decoding algorithm for a latticeLambdainR^{n}changes an arbitrary point ofR^{n}into a closest lattice point. Some general methods are given for constructing such algorithms, ami are used to obtain new and faster decoding algorithms for the Gosset latticeE_{8}, the Golay code the Leech lattice.