Robust universal complete codes for transmission and compression

Aviezri S. Fraenkel, Shmuel T. Klein

Research output: Contribution to journalArticlepeer-review

81 Scopus citations

Abstract

Several measures are defined and investigated, which allow the comparison of codes as to their robustness against errors. Then new universal and complete sequences of variable-length codewords are proposed, based on representing the integers in a binary Fibonacci numeration system. Each sequence is constant and needs not be generated for every probability distribution. These codes can be used as alternatives to Huffman codes when the optimal compression of the latter is not required, and simplicity, faster processing and robustness are preferred. The codes are compared on several "real-life" examples.

Original languageEnglish
Pages (from-to)31-55
Number of pages25
JournalDiscrete Applied Mathematics
Volume64
Issue number1
DOIs
StatePublished - 4 Jan 1996

Fingerprint

Dive into the research topics of 'Robust universal complete codes for transmission and compression'. Together they form a unique fingerprint.

Cite this