Journal ArticleDOI
A comparison of algorithms for data base compression by use of fragments as language elements
Ernst J. Schuegraf,H. S. Heaps +1 more
Reads0
Chats0
TLDR
It is found that text fragments selected by a longest match algorithm produce the best results with regard to compression and use of processing time.About:
This article is published in Information Storage and Retrieval.The article was published on 1974-09-01. It has received 55 citations till now. The article focuses on the topics: Data compression & Lossless compression.read more
Citations
More filters
Patent
Data compression apparatus and method
TL;DR: An apparatus and method for converting an input data character stream into a variable length encoded data stream in a data compression system is described in this article. But this method requires the input data characters to be stored in the history array.
Journal ArticleDOI
Modeling for text compression
TL;DR: This paper surveys successful strategies for adaptive modeling that are suitable for use in practical text compression systems, and falls into three main classes: finite-context modeling, in which the last few characters are used to condition the probability distribution for the next one.
Patent
Data compression apparatus and method using matching string searching and Huffman encoding
Clay Mayers,Douglas L. Whiting +1 more
TL;DR: In this article, a sliding window data compression algorithm is combined with Huffman encoding on the strings and raw bytes, and the Huffman table, in a compressed form, is prepended to the encoded output data.
Journal ArticleDOI
Variety generation—A reinterpretation of Shannon's mathematical theory of communication, and its implications for information science
TL;DR: A reinterpretation of Shannon's mathematical theory of communication based on the definition of new symbol sets, comprising approximately equally-frequent strings of characters, is presented and is shown to have wide applicability in computer-processing of texts.
References
More filters
Journal ArticleDOI
A Method for the Construction of Minimum-Redundancy Codes
TL;DR: A minimum-redundancy code is one constructed in such a way that the average number of coding digits per message is minimized.
Journal ArticleDOI
Variable-length binary encodings
E. N. Gilbert,Edward F. Moore +1 more
TL;DR: This paper gives a theoretical treatment of several properties which describe certain variable-length binary encodings of the sort which could be used for the storage or transmission of information, such as the prefix and finite delay properties.
Journal ArticleDOI
Finding the Shortest Route between Two Points in a Network
TL;DR: A new method is proposed for finding the shortest route between two points in an interconnected network by investigating a selection of routes from both the starting point and the terminal point.
Journal ArticleDOI
Program Design for Retrospective Searches on Large Data Bases.
Larry H. Thiel,H. S. Heaps +1 more
TL;DR: The vocabulary of the data base is automatically expressed in terms of 8, 16 and 24 bit codes chosen to point to the natural spelling in a dictionary, and file size is reduced without the necessity for extensive processing for decoding.