摘要 : A bound on the minimum distance of a binary error-correcting code is established given constraints on the computational time-space complexity of its encoder where the encoder is modeled as a branching program. The bound obtained a... 展开
作者 | Bazzi~ L.M.J. Mitter~ S.K. |
---|---|
期刊名称 | 《IEEE Transactions on Information Theory》 |
页码/总页数 | p.2103-2112 / 10 |
语种/中图分类号 | 英语 / TN |
关键词 | binary codes block codes concatenated codes error correction codes linear codes logic gates space-time codes turbo codes binary error-correcting code block length branching program concatenated turbo-like code constant-depth AND-OR circuit encoder linear |
DOI | 10.1109/TIT.2005.847727 |
馆藏号 | IELEP0138 |