Chang's lemma via Pinsker's inequality

Autor: Hambardzumyan, Lianna, Li, Yaqiao
Rok vydání: 2020
Předmět:
Zdroj: Discrete Mathematics 343.1 (2020): 111496
Druh dokumentu: Working Paper
Popis: Extending the idea in [Impagliazzo, R., Moore, C. and Russell, A., An entropic proof of Chang's inequality. SIAM Journal on Discrete Mathematics, 28(1), pp.173-176.] we give a short information theoretic proof for Chang's lemma that is based on Pinsker's inequality.
Comment: 4 pages
Databáze: arXiv