Tight Bounds for Symmetric Divergence Measures and a Refined Bound for Lossless Source Coding
classification
💻 cs.IT
math.ITmath.PR
keywords
boundsapplicationboundcodingdivergencelosslessmeasuressource
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.