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 a...

Though the schemes are different, both Horstein’s and Kudryashov’s non-block strategies for communication with feedback over the binary-symmetric channel asymptotically achieve the identical reliability function (error exponent); a function that displays some curious features. For positive rates their reliability function is strictly larger than Burnashev’s and transitions discontinuously at th...

A procedure for suboptimizing the choice of convolution codes is described. It is known that random convolution codes that have been passed through a binary symmetric channel, or a binary erasure channel, have a low probability of error and are easily decoded, but no practical procedure for finding the optimum convolution code for long code lengths is known. A convolution code is defined by its...

In this paper, a generalization of the traditional point-to-point to communication setup, which is named as “reliable communications with asymmetric codebooks”, is proposed. Under the assumption of independent identically distributed (i.i.d) encoder codewords, it is proven that the operational capacity of the system is equal to the information capacity of the system, which is given by maxp(x) I...

We consider the Gaussian multi-antenna compound broadcast channel where one transmitter transmits several messages, each intended for a different user whose channel realization is arbitrarily chosen from a finite set. Our investigation focuses on the behavior of this channel at high SNRs and we obtain the multiplexing gain of the sum capacity for a number of cases, and point out some implicatio...