On the complexity of suboptimal decoding for list and decision feedback schemes ?
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 2nR(1-R) 2 nR ( 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 2nR(1-C) 2 nR ( 1 - C ) , where C denotes the channel capacity. The reliability function is close to Forney's feedback exponent.
decision feedback list decoding decoding complexity bounded distance decoding error exponent