Chang’s lemma via Pinsker’s inequality
| Autor: | Yaqiao Li, Lianna Hambardzumyan |
|---|---|
| Rok vydání: | 2020 |
| Předmět: |
Discrete mathematics
Lemma (mathematics) 020206 networking & telecommunications 0102 computer and information sciences 02 engineering and technology Computer Science::Computational Complexity 01 natural sciences Theoretical Computer Science Combinatorics 010201 computation theory & mathematics 0202 electrical engineering electronic engineering information engineering Discrete Mathematics and Combinatorics Computer Science::Information Theory Mathematics Pinsker's inequality |
| Zdroj: | Discrete Mathematics. 343:111496 |
| ISSN: | 0012-365X |
| DOI: | 10.1016/j.disc.2019.04.015 |
| Popis: | Extending the idea in Impagliazzo et al. (2014) we give a short information theoretic proof for Chang’s lemma that is based on Pinsker’s inequality. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect