Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
ISIT
/
Paper
On Achievable Rates and Complexity of LDPC Codes for Parallel Channels: Information-Theoretic Bounds and Applications.
Igal Sason
,
Gil Wiechman
Venue
B
ISIT
Year
2006
Proceedings
ISIT
DBLP record
conf/isit/SasonW06 ↗
Browse the full
ISIT paper archive
.