A strong version of the redundancy-capacity theorem of universal coding

@article{Merhav1995ASV,
  title={A strong version of the redundancy-capacity theorem of universal coding},
  author={Neri Merhav and Meir Feder},
  journal={IEEE Trans. Information Theory},
  year={1995},
  volume={41},
  pages={714-722}
}
The capacity of the channel induced by a given class of sources is well known to be an attainable lower bound on the redundancy of universal codes with respect to this class, both in the minimax sense and in the Bayesian (maximin) sense. We show that this capacity is essentially a lower bound also in a stronger sense, that is, for “most” sources in the class. This result extends Rissanen’s lower bound for parametric families. We demonstrate the applicability of this result in several examples… CONTINUE READING

Topics from this paper.

Citations

Publications citing this paper.
SHOWING 1-10 OF 75 CITATIONS, ESTIMATED 30% COVERAGE

FILTER CITATIONS BY YEAR

1995
2019

CITATION STATISTICS

  • 15 Highly Influenced Citations

  • Averaged 3 Citations per year over the last 3 years

  • 33% Increase in citations per year in 2018 over 2017

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…