Performance Bounds for Erasure, List, and Decision Feedback Schemes With Linear Block Codes
Performance Bounds for Erasure, List, and Decision Feedback Schemes With Linear Block Codes
复制标题
DOI：
10.1109/tit.2010.2050797
复制
发表时间：
2010-08
影响因子：
2.5
通讯作者：
Eran Hof;I. Sason;S. Shamai
中科院分区：
文献类型：
--
作者：
Eran Hof;I. Sason;S. Shamai
这项工作导出了消息独立性属性和一些新的性能上限，用于在无记忆对称信道上传输线性块码的擦除、列表和决策反馈方案。与 Forney 的经典工作类似，这项工作的重点是推导这些编码方案可实现的权衡的一些 Gallager 型边界，其中主要的新颖性是边界对于随机和结构化线性块代码（或代码集合）的适用性。这些界限适用于有限长度码和无限块长度的渐近情况，并且它们适用于低密度奇偶校验码系综。
A message independence property and some new performance upper bounds are derived in this work for erasure, list, and decision-feedback schemes with linear block codes transmitted over memoryless symmetric channels. Similar to the classical work of Forney, this work is focused on the derivation of some Gallager-type bounds on the achievable tradeoffs for these coding schemes, where the main novelty is the suitability of the bounds for both random and structured linear block codes (or code ensembles). The bounds are applicable to finite-length codes and to the asymptotic case of infinite block length, and they are applied to low-density parity-check code ensembles.