Name
Abstract | ||
|---|---|---|
The problems arising in the modeling and coding of strings for compression purposes are discussed. The notion of an information source that simplifies and sharpens the traditional one is axiomatized, and adaptive and nonadaptive models are defined. With a measure of complexity assigned to the models, a fundamental theorem is proved which states that models that use any kind of alphabet extension are inferior to the best models using no alphabet extensions at all. A general class of so-called first-in first-out (FIFO) arithmetic codes is described which require no alphabet extension devices and which therefore can be used in conjunction with the best models. Because the coding parameters are the probabilities that define the model, their design is easy, and the application of the code is straightforward even with adaptively changing source models. |
Year | DOI | Venue |
|---|---|---|
1981 | 10.1109/TIT.1981.1056282 | Information Theory, IEEE Transactions |
Keywords | Field | DocType |
Source coding | Discrete mathematics,FIFO (computing and electronics),Source code,Computer science,Context tree weighting,Algorithm,Coding (social sciences),Theoretical computer science,Fundamental theorem,Shannon–Fano coding,Variable-length code,Context-adaptive binary arithmetic coding | Journal |
Volume | Issue | ISSN |
27 | 1 | 0018-9448 |
Citations | PageRank | References |
171 | 174.21 | 7 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jorma Rissanen | 1 | 1665 | 798.14 |
| Langdon, G.G., Jr. | 2 | 352 | 328.60 |