Simple Search

Query:

Enter a query and click »Search«...

Format:

Display: entries per page entries

Zbl 0874.94026
Fraenkel, Aviezri S.; Klein, Shmuel T.
Robust universal complete codes for transmission and compression. (English)
[J] Discrete Appl. Math. 64, No.1, 31-55 (1996). ISSN 0166-218X

Summary: 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.

MSC 2000:: *94A45 Codes in connection with formal languages
11B39 Special numbers, etc.

Keywords: measures; variable-length codewords; Huffman codes

Comment on this Item PDF MathML XML ASCII DVI PS BibTeX Online Ordering Article Article Journal

	Scientific prize winners of the ICM 2010
	Overhang
	Lie groups, physics and geometry. An introduction for physicists, engineers and chemists.

Simple Search

Zentralblatt MATH Berlin [Germany]