The importance of tie-breaking in finite-blocklength bounds

Eli Haim, Yuval Kochman, Uri Erez

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Upper bounds on the error probability in channel coding are considered, improving the RCU bound by taking into account events, where the likelihood of the correct codeword is tied with that of some competitors. This bound is compared to various previous results, both qualitatively and quantitatively; it is shown to be the tightest bound with respect to previous bounds with the same computational complexity. With respect to maximal error probability of linear codes, it is observed that when the channel is additive, the derivation of bounds, as well as the assumptions on the admissible encoder and decoder, simplify considerably.

Original languageEnglish
Title of host publication2013 IEEE International Symposium on Information Theory, ISIT 2013
Pages1725-1729
Number of pages5
DOIs
StatePublished - 2013
Event2013 IEEE International Symposium on Information Theory, ISIT 2013 - Istanbul, Turkey
Duration: 7 Jul 201312 Jul 2013

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
ISSN (Print)2157-8095

Conference

Conference2013 IEEE International Symposium on Information Theory, ISIT 2013
Country/TerritoryTurkey
CityIstanbul
Period7/07/1312/07/13

Fingerprint

Dive into the research topics of 'The importance of tie-breaking in finite-blocklength bounds'. Together they form a unique fingerprint.

Cite this