Abstract
Summary form only given. Two arithmetic codes have been studied. The tradeoff between the redundancy or inefficiency of the codes and their complexity (size and time) was investigated.
| Original language | English |
|---|---|
| Title of host publication | 1986 IEEE International Symposium on Information Theory (ISIT) |
| Publisher | Institute of Electrical and Electronics Engineers |
| Pages | 120-121 |
| Number of pages | 2 |
| Publication status | Published - 1986 |
Fingerprint
Dive into the research topics of 'Redundancy and complexity aspects for arithmetic codes'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver