An efficient coding system for long source sequences
C. Jones · IEEE Transactions on Information Theory · 1981
The Elias source coding scheme is modified to permit a source sequence of practically unlimited length to be coded as a single codeword using arithmetic of only limited precision. The result is shown to be a nonblock arithmetic code of the first in, first out (FIFO) type-- source symbols are decoded in the same order as they were encoded. Codeword lengths which are near optimum for the specified statistical properties of the source can be achieved. Explicit encoding and decoding algorithms are Provided which effectively implement the coding scheme. Applications to data compression and cryptography are suggested.
Cited by 94 works. doi:10.1109/tit.1981.1056356
References
- A Mathematical Theory of Communication
- New directions in cryptography
- A Method for the Construction of Minimum-Redundancy Codes
- Information Theory and Coding.
- An extension of the Shannon theory approach to cryptography
- Variable-Length Binary Encodings
- Generalized Kraft Inequality and Arithmetic Coding
- Arithmetic Coding
- Source coding algorithms for fast data compression
- An algorithm for source coding