Efficient run-length encodings
- 1 November 1982
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 28 (6) , 880-890
- https://doi.org/10.1109/tit.1982.1056593
Abstract
A method for the noiseless coding of binary memoryless sources when the symbol probabilities are unknown is investigated. Codes of long block length are constructed from truncated run-length codes. Though not universal, the codes are shown to achieve high efficiencies over a wide range of symbol probabilities. Several generalizations of the basic scheme are also presented. The schemes presented in this paper are particularly well-suited for facsimile coding.Keywords
This publication has 7 references indexed in Scilit:
- A source matching approach to finding minimax codesIEEE Transactions on Information Theory, 1980
- Variations on a theme by HuffmanIEEE Transactions on Information Theory, 1978
- A new universal coding scheme for the binary memoryless sourceIEEE Transactions on Information Theory, 1977
- Universal noiseless codingIEEE Transactions on Information Theory, 1973
- A Huffman-Shannon-Fano codeProceedings of the IEEE, 1973
- Comments on "Sequence time coading for data compression"Proceedings of the IEEE, 1966
- Sequence time coding for data compressionProceedings of the IEEE, 1966