On the redundancy of embedded codes

descriptionPublicationkeyboard_double_arrow_right Article , Other literature type 20 Jan 2003Publisher:IEEEJournal:Proceedings of the 1999 IEEE Information Theory and Communications Workshop (Cat. No. 99EX253)

Authors: G. Voronov; M. Feder;

doi: 10.1109/itcom.1999.781409

On the redundancy of embedded codes

- Summary
- Metrics

Abstract

The authors analyze redundancy, as a function of the block length of successive refinement codes. It turns out that an extra rate of O(logn/2n) must be paid for each stage of code.

Related Organizations

Tel Aviv University
Israel

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	0
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Average
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average

Found an issue? Give us feedback

0

Average

Fields of Science

engineering and technology

electrical engineering, electronic engineering, information engineering

Fields of Science

engineering and technology

electrical engineering, electronic engineering, information engineering

Upload OA version

Are you the author of this publication? Upload your Open Access version to Zenodo!

It’s fast and easy, just two clicks!

uploadUpload now