摘要 : The moderate complexity of low-density parity-check (LDPC) codes under iterative decoding is attributed to the sparseness of their parity-check matrices. It is therefore of interest to consider how sparse parity-check matrices of ... 展开
作者 | Gil Wiechman Igal Sason |
---|---|
期刊名称 | 《IEEE Transactions on Information Theory 》 |
页码/总页数 | p.550-579 / 30 |
语种/中图分类号 | 英语 / TN |
关键词 | binary codes block codes channel capacity channel coding iterative decoding linear codes matrix algebra maximum likelihood decoding message passing parity check codes LDPC codes MBIOS binary linear block codes channel capacity information-theoretic bound |
馆藏号 | IELEP0138 |