Name
Abstract | ||
|---|---|---|
Algorithms for encoding and decoding finite strings over a finite alphabet are described. The coding operations are arithmetic involving rational numbers li as parameters such that ∑i2−li≤2−ε. This coding technique requires no blocking, and the per-symbol length of the encoded string approaches the associated entropy within ε. The coding speed is comparable to that of conventional coding methods. |
Year | DOI | Venue |
|---|---|---|
1976 | 10.1147/rd.203.0198 | IBM Journal of Research and Development |
Keywords | Field | DocType |
rational number,arithmetic coding | Discrete mathematics,Tunstall coding,Range encoding,Context-adaptive variable-length coding,Huffman coding,Shannon–Fano coding,Arithmetic coding,Mathematics,Context-adaptive binary arithmetic coding,Variable-length code | Journal |
Volume | Issue | ISSN |
20 | 3 | 0018-8646 |
Citations | PageRank | References |
185 | 166.75 | 3 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jorma Rissanen | 1 | 1665 | 798.14 |