Recursive indexing and its application

Khalid Sayood, Sangsin Na

Research output: Chapter in Book/Report/Conference proceedingConference contribution


In this paper a recursive indexing scheme is presented, by which an element of a set is represented by a finite sequence of elements of a different set in a recursive manner. When applied to the reproduction alphabet of a quantizer, it can effectively reduce the size of the set on which an entropy-encoder is designed and operated, thereby reducing the complexity of the binary encoder. Numerical results show that for independent identically distributed gamma and Laplacian sources, the rate-distortion performance of a quantizer with recursive indexing is comparable to that of a vector quantizer.

Original languageEnglish (US)
Title of host publicationProceedings - 1991 IEEE International Symposium on Information Theory, ISIT 1991
PublisherInstitute of Electrical and Electronics Engineers Inc.
Number of pages1
ISBN (Electronic)0780300564
StatePublished - 1991
Event1991 IEEE International Symposium on Information Theory, ISIT 1991 - Budapest, Hungary
Duration: Jun 24 1991Jun 28 1991

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
ISSN (Print)2157-8095


Conference1991 IEEE International Symposium on Information Theory, ISIT 1991

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Information Systems
  • Modeling and Simulation
  • Applied Mathematics


Dive into the research topics of 'Recursive indexing and its application'. Together they form a unique fingerprint.

Cite this