Elements of information theory
Elements of information theory
Coding Theorems of Information Theory
Coding Theorems of Information Theory
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
General theory of information transfer: Updated
Discrete Applied Mathematics
Erasure, list, and detection zero-error capacities for low noise and a relation to identification
IEEE Transactions on Information Theory
Common randomness in information theory and cryptography. II. CR capacity
IEEE Transactions on Information Theory
New directions in the theory of identification via channels
IEEE Transactions on Information Theory
General theory of information transfer: Updated
Discrete Applied Mathematics
Strong secrecy for multiple access channels
Information Theory, Combinatorics, and Search Theory
Identification via quantum channels
Information Theory, Combinatorics, and Search Theory
Bibliography of publications by Rudolf Ahlswede
Information Theory, Combinatorics, and Search Theory
| Hi-index | 0.00 |
Among the mostly investigated parameters for noisy channels are code size, error probability in decoding, block length; rate, capacity, reliability function; delay, complexity of coding. There are several statements about connections between these quantities. They carry names like “coding theorem”, “converse theorem” (weak, strong, ...), “direct theorem”, “capacity theorem”, “lower bound”, “upper bound”, etc. There are analogous notions for source coding. This note has become necessary after the author noticed that Information Theory suffers from a lack of precision in terminology. Its purpose is to open a discussion about this situation with the goal to gain more clarity. There is also some confusion concerning the scopes of analytical and combinatorial methods in probabilistic coding theory, particularly in the theory of identification. We present a covering (or approximation) lemma for hypergraphs, which especially makes strong converse proofs in this area transparent and dramatically simplifies them.