Extremes of information combining

Authors:
I. Sutskover;S. Shamai;J. Ziv
Affiliations:
Fac. of Electr. Eng., Technion-Israel Inst. of Technol., Haifa, Israel;-;-
Venue:
IEEE Transactions on Information Theory
Year:
2005

Citing 0
Cited 7

Information combining

Foundations and Trends in Communications and Information Theory
Bit-Interleaved Coded Modulation

Foundations and Trends in Communications and Information Theory
Doubly generalized LDPC codes over the AWGN channel

IEEE Transactions on Communications
A class of transformations that polarize binary-input memoryless channels

ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3
LDPC codes for the cascaded BSC-BAWGN channel

Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Information combining for relay networks

ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Polar codes: characterization of exponent, bounds, and constructions

IEEE Transactions on Information Theory

Quantified Score

Hi-index	754.90

Visualization

Abstract

Extreme densities for information combining are found for two important channel models: the binary-input symmetric parallel broadcast channel and the parity-constrained-input symmetric parallel channels. Following, upper and lower mutual information thresholds are stated for per-bit maximum a posteriori probability (MAP) decoding and low-density parity-check (LDPC) code ensembles.