Composite scheme LR+Th for decoding with erasures and its effective equivalence to Forney's rule
IEEE Transactions on Information Theory
On the complexity of minimum distance decoding of long linear codes
IEEE Transactions on Information Theory
The complexity of information set decoding
IEEE Transactions on Information Theory
A simple derivation of the coding theorem and some applications
IEEE Transactions on Information Theory
Exponential error bounds for erasure, list, and decision feedback schemes
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
We consider bounded distance list decoding, such that the decoder calculates the list of all codewords within a sphere around the received vector. We analyze the performance and the complexity of this suboptimum list decoding scheme for the binary symmetric channel. The reliability function of the list decoding scheme is equivalent to the sphere-packing bound, where the decoding complexity is asymptotically bounded by 2^n^R^(^1^-^R^). Furthermore, we investigate a decision feedback strategy that is based on bounded distance list decoding. Here, any output with zero or many codewords will call for a repeated transmission. In this case the decoding complexity will be of the order 2^n^R^(^1^-^C^), where C denotes the channel capacity. The reliability function is close to Forney's feedback exponent.