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 language | English |
|---|---|
| Title of host publication | Proceedings IEEE International Symposium on Information Theory, 29 June-4 July 1997 |
| Place of Publication | Piscataway |
| Publisher | Institute of Electrical and Electronics Engineers |
| Pages | 68 |
| Number of pages | 1 |
| ISBN (Print) | 0-7803-3956-8 |
| DOIs | |
| Publication status | Published - 1997 |
| Event | 1997 IEEE International Symposium on Information Theory, ISIT 1997 - Ulm, Germany Duration: 29 Jun 1997 → 4 Jul 1997 |
Conference
| Conference | 1997 IEEE International Symposium on Information Theory, ISIT 1997 |
|---|---|
| Country/Territory | Germany |
| City | Ulm |
| Period | 29/06/97 → 4/07/97 |
| Other | Proc. 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
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver