Robust universal complete codes for transmission and compression

DOI10.1016/0166-218X(93)00116-HzbMath0874.94026DBLPjournals/dam/FraenkelK96OpenAlexW2069056415WikidataQ56083295 ScholiaQ56083295MaRDI QIDQ1917238

Shmuel T. Klein, Aviezri S. Fraenkel

Publication date: 7 July 1996

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: http://www.elsevier.com/locate/dam

zbMATH Keywords

measuresHuffman codesvariable-length codewords

Mathematics Subject Classification ID

Fibonacci and Lucas numbers and polynomials and generalizations (11B39) Prefix, length-variable, comma-free codes (94A45)

Related Items (13)

Compressed matching for feature vectors ⋮ Random access to Fibonacci encoded files ⋮ A space efficient direct access data structure ⋮ Enhanced ternary Fibonacci codes ⋮ The polytopic-\(k\)-step Fibonacci sequences in finite groups ⋮ Compressed matching in dictionaries ⋮ A simpler analysis of Burrows-Wheeler-based compression ⋮ Tunable multi-party high-capacity quantum key distribution based on \(m\)-generalized Fibonacci sequences using Golden coding ⋮ Huffman coding with non-sorted frequencies ⋮ Should one always use repeated squaring for modular exponentiation? ⋮ Random Access to High-Order Entropy Compressed Text ⋮ Compror: On-line lossless data compression with a factor oracle. ⋮ New compression schemes for natural number sequences

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Is Huffmann coding dead?
• The use and usefulness of numeration systems
• Huffman coding in bit-vector compression
• Robust transmission of unbounded strings using Fibonacci representations
• Self-synchronizing Huffman codes (Corresp.)
• Systems of Numeration
• Data compression
• Regent Results in Comma-Free Codes
• Universal codeword sets and representations of the integers
• Economical encoding of commas between strings
• A universal algorithm for sequential data compression
• Compression of individual sequences via variable-rate coding
• Maximal Prefix-Synchronized Codes
• Two inequalities implied by unique decipherability
• A Method for the Construction of Minimum-Redundancy Codes
• Fibonacci codes for synchronization control

This page was built for publication: Robust universal complete codes for transmission and compression