Constrained Information Combining: Theory and Applications for LDPC Coded Systems

DOI10.1109/TIT.2007.894645zbMATH Open1314.94047MaRDI QIDQ3548147FDOQ3548147

Authors: Ilan Sutskover, Jacob Ziv, S. Shamai 

Publication date: 21 December 2008

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

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

zbMATH Keywords

entropymutual informationLagrange dual problemprobability of errorinformation flowChebyshev systemschannel codingiterative decodingturbo codeslow-density parity-check (LDPC) codesBit error rate (BER)extrinsic information transfer (EXIT) chartsinformation combiningmaximum a posteriori probability (MAP) decoding

Mathematics Subject Classification ID

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

Cited In (3)

• Title not available (Why is that?)
• Extremes of Information Combining
• Extremal Problems of Information Combining

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)