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