Noisy Chinese remaindering in the Lee norm
Journal of Complexity - Special issue on coding and cryptography
On universally decodable matrices for space---time coding
Designs, Codes and Cryptography
| Hi-index | 754.84 |
In this article, Sudan's algorithm is modified into an efficient method to list-decode a class of codes which can be seen as a generalization of Reed-Solomon codes. The algorithm is specialized into a very efficient method for unique decoding. The code construction can be generalized based on algebraic-geometry codes and the decoding algorithms are generalized accordingly. Comparisons with Reed-Solomon and Hermitian codes are made