二进制线性分组码ML译码错误概率的紧上界
信息论
2007-07-13 v1 math.IT
摘要
通过推导二进制线性分组码译码错误概率的紧上界来探讨最大似然(ML)译码的性能。这些关于块错误概率和比特错误概率的上界对任意无记忆、二进制输入且输出对称的通信信道均有效，并以AWGN信道上各种类turbo码码集为例说明了其有效性。对二进制线性分组码距离谱的剔除进一步收紧了所得上界。
引用
@article{arxiv.cs/0607003,
title = {Tightened Upper Bounds on the ML Decoding Error Probability of Binary Linear Block Codes},
author = {M. Twitto and I. Sason and S. Shamai},
journal= {arXiv preprint arXiv:cs/0607003},
year = {2007}
}
备注
Submitted to the IEEE Trans. on Information Theory (as a correspondence), February 2006