Skip to content

On Achievable Rates and Complexity of LDPC Codes for Parallel Channels: Information-Theoretic Bounds and Applications.

Igal Sason, Gil Wiechman

VenueBISIT
Year2006
ProceedingsISIT

Browse the full ISIT paper archive.