Performance analysis of linear codes under maximum-likelihood decoding: a tutorial
Communications and Information Theory
Sharp bounds for optimal decoding of low-density parity-check codes
IEEE Transactions on Information Theory
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2
The generalized area theorem and some of its consequences
IEEE Transactions on Information Theory
On construction of moderate-length LDPC codes over correlated erasure channels
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Tight thresholds for cuckoo hashing via XORSAT
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
LT-codes and phase transitions for mutual information
ICITS'11 Proceedings of the 5th international conference on Information theoretic security
| Hi-index | 754.96 |
There is a fundamental relationship between belief propagation and maximum a posteriori decoding. A decoding algorithm, which is called the Maxwell decoder, is introduced and provides a constructive description of this relationship. Both the algorithm itself and the analysis of the new decoder are reminiscent of the Maxwell construction in thermodynamics. This paper investigates in detail the case of transmission over the binary erasure channel, while the extension to general binary memoryless channels is discussed in a companion paper.