Robust universal complete codes for transmission and compression

DOI10.1016/0166-218X(93)00116-HMaRDI QIDQ1917238zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Aviezri S. Fraenkel, Shmuel T. Klein

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

Huffman codesmeasuresvariable-length codewords

Mathematics Subject Classification ID

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

Recommendations

• Optimal universal coding with respect to the maximal individual relative redundancy criterion
• Robust transmission of unbounded strings using Fibonacci representations
• Problems of robustness for universal coding schemes

Cites work

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

Cited in

(21)

• Compressed matching in dictionaries
• Compror: On-line lossless data compression with a factor oracle.
• Tunable multi-party high-capacity quantum key distribution based on \(m\)-generalized Fibonacci sequences using Golden coding
• New compression schemes for natural number sequences
• The third order variations on the Fibonacci universal code
• A space efficient direct access data structure
• A simpler analysis of Burrows-Wheeler-based compression
• Random access to high-order entropy compressed text
• Compressed matching for feature vectors
• Random access to Fibonacci encoded files
• Regular universal codeword sets (Corresp.)
• Fast decoding algorithms for variable-lengths codes
• Enhanced ternary Fibonacci codes
• Binary mixed-digit data compression codes
• The polytopic-k-step Fibonacci sequences in finite groups
• Synchronizing dynamic Huffman codes
• Dense non-binary Fibonacci codes
• Huffman coding with non-sorted frequencies
• Channel simulation: theory and applications to lossy compression and differential privacy
• Binary codes for locally homogeneous sequences
• Should one always use repeated squaring for modular exponentiation?

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1917238)