TY - GEN
T1 - One-shot multivariate covering lemmas via weighted sum and concentration inequalities
AU - Yassaee, Mohammad H.
AU - Liu, Jingbo
AU - Verdu, Sergio
N1 - Publisher Copyright:
© 2017 IEEE.
PY - 2017/8/9
Y1 - 2017/8/9
N2 - New one-shot bounds for multivariate covering are derived via a weighted sum technique and a one-sided concentration inequality which is stronger than the McDiarmid inequality. The new bounds are more compact and sharper than known bounds in the literature. In particular, the covering error can be shown to decay doubly exponentially in the blocklength. Implications for the error exponent in broadcast channels are discussed.
AB - New one-shot bounds for multivariate covering are derived via a weighted sum technique and a one-sided concentration inequality which is stronger than the McDiarmid inequality. The new bounds are more compact and sharper than known bounds in the literature. In particular, the covering error can be shown to decay doubly exponentially in the blocklength. Implications for the error exponent in broadcast channels are discussed.
UR - http://www.scopus.com/inward/record.url?scp=85034044477&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85034044477&partnerID=8YFLogxK
U2 - 10.1109/ISIT.2017.8006612
DO - 10.1109/ISIT.2017.8006612
M3 - Conference contribution
AN - SCOPUS:85034044477
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 669
EP - 673
BT - 2017 IEEE International Symposium on Information Theory, ISIT 2017
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2017 IEEE International Symposium on Information Theory, ISIT 2017
Y2 - 25 June 2017 through 30 June 2017
ER -