Tie breaking for singular channels is worth 1 nat

Eli Haim, Yuval Kochman, Uri Erez

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

1 Scopus citations

Abstract

We consider the finite-blocklength performance of singular channels (e.g., the binary erasure channel). At least for symmetric singular channels, it is known that the next correction term after the channel dispersion is the "constant" term. We show that for such channels, the asymptotic significance of tie breaking (i.e., making a fair decision in the case of multiple codewords of equal likelihood) is greater than for non-singular channels. Specifically, for an ensemble of codebooks, where the codewords are independent with the same marginal distribution, the constant correction term is increased by exactly one nat.

Original languageEnglish
Title of host publication2014 IEEE 28th Convention of Electrical and Electronics Engineers in Israel, IEEEI 2014
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)9781479959877
DOIs
StatePublished - 2014
Event2014 28th IEEE Convention of Electrical and Electronics Engineers in Israel, IEEEI 2014 - Eilat, Israel
Duration: 3 Dec 20145 Dec 2014

Publication series

Name2014 IEEE 28th Convention of Electrical and Electronics Engineers in Israel, IEEEI 2014

Conference

Conference2014 28th IEEE Convention of Electrical and Electronics Engineers in Israel, IEEEI 2014
Country/TerritoryIsrael
CityEilat
Period3/12/145/12/14

Bibliographical note

Publisher Copyright:
© Copyright 2015 IEEE All rights reserved.

Fingerprint

Dive into the research topics of 'Tie breaking for singular channels is worth 1 nat'. Together they form a unique fingerprint.

Cite this