匡威
误差概率
高斯分布
计算机科学
编码(社会科学)
离散数学
频道(广播)
数学
组合数学
算法
统计
物理
电信
几何学
量子力学
作者
Yury Polyanskiy,H. Vincent Poor,Sergio Verdú
标识
DOI:10.1109/tit.2010.2043769
摘要
This paper investigates the maximal channel coding rate achievable at a given blocklength and error probability. For general classes of channels new achievability and converse bounds are given, which are tighter than existing bounds for wide ranges of parameters of interest, and lead to tight approximations of the maximal achievable rate for blocklengths n as short as 100. It is also shown analytically that the maximal rate achievable with error probability ¿ isclosely approximated by C - ¿(V/n) Q -1 (¿) where C is the capacity, V is a characteristic of the channel referred to as channel dispersion , and Q is the complementary Gaussian cumulative distribution function.
科研通智能强力驱动
Strongly Powered by AbleSci AI