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
Proceedings of the First French-Israeli Workshop on Algebraic Coding
Finite-length scaling for iteratively decoded LDPC ensembles
IEEE Transactions on Information Theory
Hi-index | 0.06 |
We derive improved isoperimetric inequalities for discrete product measures on the n-dimensional cube. As a consequence, a general theorem on the threshold behaviour of monotone properties is obtained. This is then applied to coding theory when we study the probability of error after decoding.