Constrained Information Combining: Theory and Applications for LDPC Coded Systems

DOI10.1109/TIT.2007.894645MaRDI QIDQ3548147zbMATH OpenFDO

Authors Ilan Sutskover, Jacob Ziv, S. Shamai

Publication date 21 December 2008

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TIT.2007.894645

zbMATH Keywords

Bit error rate (BER)channel codingChebyshev systemsentropyextrinsic information transfer (EXIT) chartsinformation combininginformation flowiterative decodingLagrange dual problemlow-density parity-check (LDPC) codesmaximum a posteriori probability (MAP) decodingmutual informationprobability of errorturbo codes

Mathematics Subject Classification ID

Information theory (general) (94A15) Rate-distortion theory in information and communication theory (94A34) Combined modulation schemes (including trellis codes) in coding theory (94B12) Decoding (94B35)

Recommendations

• Performance of low-density parity-check codes with linear minimum distance
• Bounds on the performance of belief propagation decoding
• Parity-Check Density Versus Performance of Binary Linear Block Codes: New Bounds and Applications
• On the theory of low-density convolutional codes. II
• On Achievable Rates and Complexity of LDPC Codes Over Parallel Channels: Bounds and Applications

Cited in

(4)

• scientific article; zbMATH DE number 6493765 (Why is no real title available?)
• Extremes of Information Combining
• Extremal Problems of Information Combining
• Forced-convergence decoding for {LDPC}-coded modulation

This page was built for publication: Constrained Information Combining: Theory and Applications for LDPC Coded Systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3548147)