Performance analysis of linear codes under maximum-likelihood decoding: a tutorial
Communications and Information Theory
| Hi-index | 754.84 |
An average Hamming weight enumerator is derived for the codewords at each Hamming distance from a received pattern in the set of all possible binary expansions of a Reed-Solomon code. Since these codes may be decoded by list decoders, such as those studied by Sudan (1997), the enumerator can be used to estimate the average number of codewords in the list returned by such a decoder