Text compression methods
From MaRDI portal
Publication:805263
DOI10.1007/BF01099202zbMATH Open0728.68095MaRDI QIDQ805263FDOQ805263
Authors: N. E. Zubov
Publication date: 1991
Published in: Journal of Soviet Mathematics (Search for Journal in Brave)
Recommendations
Coding theorems (Shannon theory) (94A24) Natural language processing (68T50) Computing methodologies for text processing; mathematical typography (68U15)
Cites Work
- A Mathematical Theory of Communication
- Compression of individual sequences via variable-rate coding
- Prediction and Entropy of Printed English
- A universal algorithm for sequential data compression
- A Method for the Construction of Minimum-Redundancy Codes
- Huffman coding in bit-vector compression
- Linear Algorithm for Data Compression via String Matching
- Arithmetic Coding
- Enumerative source encoding
- Run-length encodings (Corresp.)
- Data compression via textual substitution
- Title not available (Why is that?)
- Effects of Configuration Interaction on Intensities and Phase Shifts
- Variations on a theme by Huffman
- Generalized Kraft Inequality and Arithmetic Coding
- Universal modeling and coding
- A “Law≓ of occurrences for words of low frequency
- An algorithm for source coding
- Combinatorial Compression and Partitioning of Large Dictionaries
- Compression of large inverted files with hyperbolic term distribution
- A Double-Adaptive File Compression Algorithm
- Title not available (Why is that?)
- Title not available (Why is that?)
- A general minimum-redundancy source-coding algorithm
- Overhead Storage Considerations and a Multilinear Method for Data File Compression
- An efficient coding system for long source sequences
- Storage-efficient representation of decimal data
- Zipf's law and entropy (Corresp.)
- Information compression by factorising common strings
- Compaction of diagnostic messages for compilers
- Criteria for choosing subsets to obtain maximum relative entropy
- Compacting homogeneous text for minimizing storage space
- A new technique for compression and storage of data
- Graph theoretic prefix codes and their synchronizing properties
- Optimal variable length codes (arbitrary symbol cost and equal code word probability)
- On variable-length-to-block coding
Cited In (2)
This page was built for publication: Text compression methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q805263)