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

by Igal Sason, Gil Wiechman

Published in International Symposium on Information Theory by IEEE.

2006   p406-410

Archived Files and Locations

application/pdf  306.5 kB
file_bxq35j5dxbfovoltyjsjk5xpji
web.archive.org (webarchive)
webee.technion.ac.il (web)
application/pdf  152.8 kB
file_kwzdskqoxndu7afvpzjsl6ifsm
webee.technion.ac.il (web)
web.archive.org (webarchive)
application/pdf  182.4 kB
file_duqduv4ur5euxhb67iqrcrj5ke
web.archive.org (webarchive)
core.ac.uk (web)
Read Archived PDF
Preserved and Accessible
Type  paper-conference
Stage   published
Year   2006
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: aa862b76-568d-4771-8d88-b90afd744cf9
API URL: JSON