An adaptive character wordlength algorithm for data compression
From MaRDI portal
(Redirected from Publication:931760)
Recommendations
Cites work
- A fast and efficient nearly-optimal adaptive Fano coding scheme
- A Method for the Construction of Minimum-Redundancy Codes
- A nearly-optimal Fano-based coding algorithm
- A universal algorithm for sequential data compression
- Algorithm 673
- Compression of individual sequences via variable-rate coding
- Data compression
- Design and analysis of dynamic Huffman codes
- Dynamic huffman coding
Cited in
(6)- scientific article; zbMATH DE number 5806042 (Why is no real title available?)
- A criticism of the ACW algorithm
- A novel algorithm for text data compression based on arithmetic codec
- A new approach to alphabet extension for improving static compression schemes
- Error detection in arithmetic coding with artificial markers
- A novel lossless data compression scheme based on the error correcting Hamming codes
This page was built for publication: An adaptive character wordlength algorithm for data compression
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q931760)