High-speed turbo-TCM-coded orthogonal frequency-division multiplexing ultra-wideband systems
EURASIP Journal on Wireless Communications and Networking
Coding schemes for relay-assisted information embedding
IEEE Transactions on Information Forensics and Security
Low-complexity coded-modulation for ISI-constrained channels
IEEE Transactions on Communications
Efficient oblivious transfer from algebraic signaling over the Gaussian channel
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2
Joint Wyner-Ziv/dirty-paper coding by modulo-lattice modulation
IEEE Transactions on Information Theory
Robust distributed multiview video compression for wireless camera networks
IEEE Transactions on Image Processing
On the dimensionality of multilevel coded modulation in the high SNR regime
IEEE Communications Letters
Capacity of the Gaussian two-way relay channel to within 1/2 bit
IEEE Transactions on Information Theory
| Hi-index | 754.96 |
A simple sphere bound gives the best possible tradeoff between the volume per point of an infinite array L and its error probability on an additive white Gaussian noise (AWGN) channel. It is shown that the sphere bound can be approached by a large class of coset codes or multilevel coset codes with multistage decoding, including certain binary lattices. These codes have structure of the kind that has been found to be useful in practice. Capacity curves and design guidance for practical codes are given. Exponential error bounds for coset codes are developed, generalizing Poltyrev's (1994) bounds for lattices. These results are based on the channel coding theorems of information theory, rather than the Minkowski-Hlawka theorem of lattice theory