Robust universal complete codes for transmission and compression
- 1 January 1996
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 64 (1) , 31-55
- https://doi.org/10.1016/0166-218x(93)00116-h
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Is Huffman coding dead?Computing, 1993
- Efficient decoding of prefix codesCommunications of the ACM, 1990
- The use and usefulness of numeration systemsInformation and Computation, 1989
- Robust transmission of unbounded strings using Fibonacci representationsIEEE Transactions on Information Theory, 1987
- Systems of NumerationThe American Mathematical Monthly, 1985
- Self-synchronizing Huffman codes (Corresp.)IEEE Transactions on Information Theory, 1984
- Maximal Prefix-Synchronized CodesSIAM Journal on Applied Mathematics, 1978
- Economical encoding of commas between stringsCommunications of the ACM, 1978
- Universal codeword sets and representations of the integersIEEE Transactions on Information Theory, 1975
- Synchronization of binary messagesIEEE Transactions on Information Theory, 1960