DocumentCode :
2977375
Title :
Simple channel coding bounds
Author :
Wang, Ligong ; Colbeck, Roger ; Renner, Renato
Author_Institution :
Signal & Inf. Process. Lab., ETH Zurich, Zurich, Switzerland
fYear :
2009
fDate :
June 28 2009-July 3 2009
Firstpage :
1804
Lastpage :
1808
Abstract :
New channel coding converse and achievability bounds are derived for a single use of an arbitrary channel. Both bounds are expressed using a quantity called the ldquosmooth 0-divergencerdquo, which is a generalization of Renyi´s divergence of order 0. The bounds are also studied in the limit of large block-lengths. In particular, they combine to give a general capacity formula which is equivalent to the one derived by Verdu and Han.
Keywords :
channel coding; Renyi divergence; arbitrary channel; simple channel coding bounds; smooth 0-divergence; Channel coding; Computer science; Decoding; Error probability; Information processing; Kernel; Laboratories; Physics; Signal processing; Stochastic processes;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Theory, 2009. ISIT 2009. IEEE International Symposium on
Conference_Location :
Seoul
Print_ISBN :
978-1-4244-4312-3
Electronic_ISBN :
978-1-4244-4313-0
Type :
conf
DOI :
10.1109/ISIT.2009.5205312
Filename :
5205312
Link To Document :
بازگشت