Performance Analysis of Fano Coding

完整後設資料紀錄

DC 欄位	值	語言
dc.contributor.author	Krajci, Stanislav	en_US
dc.contributor.author	Liu, Chin-Fu	en_US
dc.contributor.author	Mikes, Ladislav	en_US
dc.contributor.author	Moser, Stefan M.	en_US
dc.date.accessioned	2017-04-21T06:49:34Z	-
dc.date.available	2017-04-21T06:49:34Z	-
dc.date.issued	2015	en_US
dc.identifier.isbn	978-1-4673-7704-1	en_US
dc.identifier.uri	http://hdl.handle.net/11536/136302	-
dc.description.abstract	A rigorous performance analysis of Fano coding is presented, providing an upper bound on the average codeword length of binary and ternary Fano codes for an arbitrary discrete memoryless source. The performance bound is slightly better than Shannon\'s well-known bound for Shannon coding. As a by-product a novel general lower bound on Shannon entropy is derived that might be of interest also in a different context. This bound is expressed with the help of variational distance and provides a special case of a reverse Pinsker inequality.	en_US
dc.language.iso	en_US	en_US
dc.subject	Entropy lower bound	en_US
dc.subject	Fano coding	en_US
dc.subject	reverse Pinsker inequality	en_US
dc.subject	Shannon entropy	en_US
dc.subject	variational distance	en_US
dc.title	Performance Analysis of Fano Coding	en_US
dc.type	Proceedings Paper	en_US
dc.identifier.journal	2015 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT)	en_US
dc.citation.spage	1746	en_US
dc.citation.epage	1750	en_US
dc.contributor.department	電機學院	zh_TW
dc.contributor.department	College of Electrical and Computer Engineering	en_US
dc.identifier.wosnumber	WOS:000380904701160	en_US
dc.citation.woscount	0	en_US
顯示於類別：	會議論文