On the Jensen - Shannon divergence and variational distance

IEEE Transactions on Information Theory

Volumn 51, Issue 9, 2005, Pages 3333-3336

  Tsai, Shi Chun ^a   Tzeng, Wen Guey ^a   Wu, Hsin Lung ^a  

^a NATIONAL CHIAO TUNG UNIVERSITY   (Taiwan)

Author keywords

Expander; Extractors; Jensen Shannon divergence; Left over hash lemma; Parity lemma

Indexed keywords

COMPUTATIONAL COMPLEXITY; PROBABILITY DISTRIBUTIONS; RANDOM PROCESSES; THEOREM PROVING; VARIATIONAL TECHNIQUES;

JENSEN-SHANNON DIVERGENCE; LEFTOVER HASH LEMMA; PARITY LEMMA; VARIATIONAL DISTANCE;

INFORMATION THEORY;

EID: 26444541679     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2005.853308     Document Type: Article

References (14)

1. N. Alon and J. Spencer, The Probabilistic Method, 2nd ed. New York: Wiley, 2000.
2. Z. Bar-Yossef, "Sampling lower bounds via information theory," in Proc. 35th Annu. ACM Symp. Theory of Computing, San Diego, CA, 2003, pp. 335-344.
3. T. M. Cover and J. A. Thomas, Elements of Information Theory. New York: Wiley, 1991.
4. D. M. Endres and J. E. Schindelin, "A new metric for probability distributions," IEEE Trans. Inf. Theory, vol. 49, no. 7, pp. 1858-1860, Jul. 2003.
5. R. Impagliazzo and D. Zuckerman, "How to recycle random bits," in Proc. 30th IEEE Symp. Foundations of Computer Science, NC, Oct. 1989, pp. 248-253.
6. J. Lin, "Divergence measures based on the shannon entropy," IEEE Trans. Inf. Theory, vol. 37, no. 1, pp. 145-151, Jan. 1991.
7. R. Motwani and P. Raghavan, Randomized Algorithms. Cambridge, U.K.: Cambridge Univ. Press, 1995.
8. N. Nisan and D. Zuckerman, "Randomness is linear in space," J. Comp. Syst. Sci., vol. 52, no. 1, pp. 43-52, Feb. 1996.
9. D. R. Stinson, "Universal hash families and the leftover hash lemma, and applications to cryptography and computing," J. Combin. Math. Combin. Comput, vol. 42, pp. 3-31, 2002.
10. F. Topsøe, "Some inequalities for information divergence and related measures of discrimination," IEEE Trans. Inf. Theory, vol. 46, no. 4, pp. 1602-1609, Jul. 2000.
11. L. Trevisan, "Construction of extractors using pseudorandom generators," in Proc. 31st ACM Symp. Theory of Computing, Atlanta, GA, 1999, pp. 141-148.
12. U. Vazirani, "Strong communication complexity of generating quasirandom sequences from two communicating semi-random sources," Combinatorica, vol. 7, no. 4, pp. 375-392, 1987.
13. A. C. Yao, "Theory and applications of trapdoor functions," in Proc. 23rd Annu. IEEE Symp. Foundations of Computer Science, Chicago, IL, Nov. 1982, pp. 80-91.
14. R. W. Yeung, A First Course in Information Theory. New York: Kluwer Academic/Plenum, 2002.