Distortion program-size complexity with respect to a fidelity criterion and rate-distortion function

@article{Yang1993DistortionPC,
  title={Distortion program-size complexity with respect to a fidelity criterion and rate-distortion function},
  author={En-Hui Yang and Shi-Yi Shen},
  journal={IEEE Trans. Information Theory},
  year={1993},
  volume={39},
  pages={288-292}
}

From This Paper

Topics from this paper.
22 Citations
5 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 22 extracted citations

References

Publications referenced by this paper.
Showing 1-5 of 5 references

Universal almost sure data compression,

  • D. S. Omstein, P. C. Shields
  • Ann. Probab.,
  • 1990

Suboptimal state estimation for continuous - time nonlinear systems for discrete noise measurement

  • A. Bertolini
  • IEEE Trans . Automat . Contr .
  • 1988

Complexity of finite objects and justification of the notion of information and randomness in the framework of the theory of algorithms,

  • L. K. Zvonkin, L. A. Levin
  • Usp. Mat. Nauk,
  • 1970

The proof of Levin ’ s conjecture

  • L. A. Levin
  • Complexity of finite objects and justification of…
  • 1970

Similar Papers

Loading similar papers…