TY - GEN
T1 - The importance of tie-breaking in finite-blocklength bounds
AU - Haim, Eli
AU - Kochman, Yuval
AU - Erez, Uri
N1 - Funding Information:
Portions of this research were sponsored by the U. S. National Science Foundation (9734275), the U. S. Army Research Laboratory (under Contract No. DAAL01-98-K-0075 and the MICRA program), and the Defense Advanced Research Projects Agency (MDA972-00-1-0023, through Brown University).
PY - 2013
Y1 - 2013
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=84890336562&partnerID=8YFLogxK
U2 - 10.1109/ISIT.2013.6620522
DO - 10.1109/ISIT.2013.6620522
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:84890336562
SN - 9781479904464
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 1725
EP - 1729
BT - 2013 IEEE International Symposium on Information Theory, ISIT 2013
T2 - 2013 IEEE International Symposium on Information Theory, ISIT 2013
Y2 - 7 July 2013 through 12 July 2013
ER -