Information Theory and Reliable Communication
Information Theory and Reliable Communication
Information Theory: Coding Theorems for Discrete Memoryless Systems
Information Theory: Coding Theorems for Discrete Memoryless Systems
Information theory and statistics: a tutorial
Communications and Information Theory
The capacity of finite Abelian group codes over symmetric memoryless channels
IEEE Transactions on Information Theory
A converse coding theorem for mismatched decoding at the output of binary-input memoryless channels
IEEE Transactions on Information Theory - Part 2
Universal decoding for channels with memory
IEEE Transactions on Information Theory
On the universality of the LZ-based decoding algorithm
IEEE Transactions on Information Theory
Reliable communication under channel uncertainty
IEEE Transactions on Information Theory
Fading channels: information-theoretic and communications aspects
IEEE Transactions on Information Theory
Fading channels: how perfect need "perfect side information" be?
IEEE Transactions on Information Theory
Information projections revisited
IEEE Transactions on Information Theory
On wide-band broadcast channels
IEEE Transactions on Information Theory
Universal decoding for frequency-selective fading channels
IEEE Transactions on Information Theory
Channel capacity for a given decoding metric
IEEE Transactions on Information Theory
Towards joint tardos decoding: the 'don quixote' algorithm
IH'11 Proceedings of the 13th international conference on Information hiding
A simple tracing algorithm for binary fingerprinting code under averaging attack
Proceedings of the first ACM workshop on Information hiding and multimedia security
| Hi-index | 754.84 |
Over discrete memoryless channels (DMC), linear decoders (maximizing additive metrics) afford several nice properties. In particular, if suitable encoders are employed, the use of decoding algorithms with manageable complexities is permitted. For a compound DMC, decoders that perform well without the channel's knowledge are required in order to achieve capacity. Several such decoders have been studied in the literature, however, there is no such known decoder which is linear. Hence, the problem of finding linear decoders achieving capacity for compound DMC is addressed, and it is shown that under minor concessions, such decoders exist and can be constructed. A geometric method based on the very noisy transformation is developed and used to solve this problem.