Text compression methods
type: Item
instance of: scholarly article
title: Text compression methods
zbMATH Open document ID: 0728.68095
DOI: 10.1007/BF01099202
author: N. E. Zubov
published in: Journal of Soviet Mathematics
publication date: 1991-01-01T00:00:00Z
review text: Review article.
Mathematics Subject Classification ID: 68T50
Mathematics Subject Classification ID: 94A24
Mathematics Subject Classification ID: 68U15
zbMATH DE Number: 4203749
zbMATH Keywords: text compression
zbMATH Keywords: coding
MaRDI profile type: Publication
cites work: Graph theoretic prefix codes and their synchronizing properties
cites work: A “Law≓ of occurrences for words of low frequency
cites work: Storage-efficient representation of decimal data
cites work: Enumerative source encoding
cites work: Effects of Configuration Interaction on Intensities and Phase Shifts
cites work: Combinatorial Compression and Partitioning of Large Dictionaries
cites work: Variations on a theme by Huffman
cites work: Run-length encodings (Corresp.)
cites work: A general minimum-redundancy source-coding algorithm
cites work: A new technique for compression and storage of data
cites work: Compaction of diagnostic messages for compilers
cites work: A Method for the Construction of Minimum-Redundancy Codes
cites work: Huffman coding in bit-vector compression
cites work: On variable-length-to-block coding
cites work: An efficient coding system for long source sequences
cites work: A Double-Adaptive File Compression Algorithm
cites work: Information compression by factorising common strings
cites work: Q3727856
cites work: Generalized Kraft Inequality and Arithmetic Coding
cites work: Q3855094
cites work: Arithmetic Coding
cites work: Universal modeling and coding
cites work: Linear Algorithm for Data Compression via String Matching
cites work: An algorithm for source coding
cites work: Compression of large inverted files with hyperbolic term distribution
cites work: Q4053104
cites work: A Mathematical Theory of Communication
cites work: Prediction and Entropy of Printed English
cites work: Data compression via textual substitution
cites work: Compacting homogeneous text for minimizing storage space
cites work: Optimal variable length codes (arbitrary symbol cost and equal code word probability)
cites work: Criteria for choosing subsets to obtain maximum relative entropy
cites work: Zipf's law and entropy (Corresp.)
cites work: Overhead Storage Considerations and a Multilinear Method for Data File Compression
cites work: A universal algorithm for sequential data compression
cites work: Compression of individual sequences via variable-rate coding
Recommended article: Text and hypertext compression
Recommended article: SEMI-LOSSLESS TEXT COMPRESSION
Recommended article: Q3688300
Recommended article: Boosting textual compression in optimal linear time
description: scientific article; zbMATH DE number 4203749