Live-and-die coding for binary piecewise I.I.D. sources

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

17 Citations (Scopus)

Abstract

We propose a binary live-and-die scheme based on arithmetic coding. We also discuss Q-ary live-and-die coding methods. They have a better redundancy behavior than the binary method but also higher complexity demands.
Original languageEnglish
Title of host publicationProceedings IEEE International Symposium on Information Theory, 29 June-4 July 1997
Place of PublicationPiscataway
PublisherInstitute of Electrical and Electronics Engineers
Pages68
Number of pages1
ISBN (Print)0-7803-3956-8
DOIs
Publication statusPublished - 1997
Event1997 IEEE International Symposium on Information Theory, ISIT 1997 - Ulm, Germany
Duration: 29 Jun 19974 Jul 1997

Conference

Conference1997 IEEE International Symposium on Information Theory, ISIT 1997
Country/TerritoryGermany
CityUlm
Period29/06/974/07/97
OtherProc. 1997 IEEE International Symposium on Information Theory, Ulm, Germany, 29 June - 2 July 1997

Fingerprint

Dive into the research topics of 'Live-and-die coding for binary piecewise I.I.D. sources'. Together they form a unique fingerprint.

Cite this