Patent
Stem for dynamically compressing and decompressing electronic data
James A. Storer
- 15 Oct 1987
169
TL;DR: In this paper, a data compression system for encoding and decoding textual data, including an encoder for encoding the data and a decoder for decoding the encoded data, is presented.
read more
Abstract: A data compression system for encoding and decoding textual data, including an encoder for encoding the data and for a decoder for decoding the encoded data Both encoder and decoder have dictionaries for storing frequently-appearing strings of characters Each string is identified by a unique pointer The input data stream is parsed and matched with strings in the encoder dictionary using a novel matching algorithm The pointer associated with the matched string is then transmitted to a remote location for storage or decoding Thereafter, using a novel update algorithm the encoder dictionary is updated to include new strings of data based on the matched string of data If required, a novel deletion algorithm is employed to remove infrequently used strings of data to provide room for the newly generated strings of data The strings of data may be arranged using a modified least recently used queue The decoder matches each unique pointer in the stream of compressed input data with a corresponding pointer in the decoder dictionary The decoder then transmits the string of character data associated with the matched pointer, thereby providing textual data in original, uncompressed form Thereafter, using the novel update and deletion algorithms, new strings of data are added to, and old strings of data are deleted from, the decoder dictionary, so as to ensure both encoder and decoder dictionaries contain identical strings of data
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Patent
Secure data interchange
Frederick S. M. Herz,Walter Paul Labys,David C. Parkes,Sampath Kannan,Jason Eisner +4 more
- 27 Oct 2000
TL;DR: A secure data interchange system enables information about bilateral and multilateral interactions between multiple persistent parties to be exchanged and leveraged within an environment that uses a combination of techniques to control access to information, release of information, and matching of information back to parties as mentioned in this paper.
1.8K
Patent
Data compression apparatus and method
Douglas L. Whiting,Glen A. George,Glen E. Ivey +2 more
- 09 May 1994
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.
429
Patent
Content independent data compression method and system
James J. Fallon
- 08 Apr 2006
TL;DR: In this paper, a method for compressing data comprises the steps of: analyzing a data block of an input data stream to identify a data type of the data block, the input dataset consisting of a plurality of disparate data types; performing content dependent data compression on the block; and performing content independent data compression if the data type is not identified.
304
Patent
Storing personal medical information
Lawrence E. Feinberg
- 07 May 1997
TL;DR: In this article, a system and method for data compression of structured medical history information using multiple, updatable, static dictionaries in conjunction with an advanced probability-based model is presented.
241
Patent
Parallel decompression and compression system and method for improving storage density and access speed for non-volatile memory and embedded memory devices
Thomas A. Dye
- 26 Apr 1999
TL;DR: The Compression Enhanced Flash Memory Controller (CEFMC) as discussed by the authors uses parallel lossless compression and decompression engines embedded into the flash memory controller unit for improved memory density and data bandwidth.
225
References
A Method for the Construction of Minimum-Redundancy Codes
David A. Huffman
- 01 Sep 1952
TL;DR: A minimum-redundancy code is one constructed in such a way that the average number of coding digits per message is minimized.
6.1K
On the Complexity of Finite Sequences
A. Lempel,Jacob Ziv +1 more
TL;DR: A new approach to the problem of evaluating the complexity ("randomness") of finite sequences is presented, related to the number of steps in a self-delimiting production process by which a given sequence is presumed to be generated.
2.8K
A Technique for High-Performance Data Compression
TL;DR: A new compression algorithm is introduced that is based on principles not found in existing commercial methods in that it dynamically adapts to the redundancy characteristics of the data being compressed, and serves to illustrate system problems inherent in using any compression scheme.
2.6K
Data compression via textual substitution
TL;DR: A general model for data compression which includes most data compression systems in the fiterature as special cases is presented and trade-offs between different varieties of macro schemes, exact lower bounds on the amount of compression obtainable, and the complexity of encoding and decoding are discussed.
768
Patent
High speed data compression and decompression apparatus and method
Welch Terry A
- 18 Jun 1984
TL;DR: In this paper, a data compressor compresses an input stream of data character signals by storing in a string table strings encountered in the input stream, where each string comprises a prefix string and an extension character where the extension character is the last character in the string and the prefix string comprises all but the extension characters.
356
Related Papers (5)
Victor S. Miller,Mark N. Wegman +1 more
- 11 Aug 1986
Douglas L. Whiting,Glen A. George,Glen E. Ivey +2 more
- 09 May 1994
Douglas L. Whiting,Glen A. George +1 more
- 06 Oct 1989