2000 character limit reached
Tight Bounds for Symmetric Divergence Measures and a Refined Bound for Lossless Source Coding (1403.7164v7)
Published 27 Mar 2014 in cs.IT, math.IT, and math.PR
Abstract: Tight bounds for several symmetric divergence measures are derived in terms of the total variation distance. It is shown that each of these bounds is attained by a pair of 2 or 3-element probability distributions. An application of these bounds for lossless source coding is provided, refining and improving a certain bound by Csisz\'{a}r. Another application of these bounds has been recently introduced by Yardi. et al. for channel-code detection.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.