1
Willard L Eastman, Abraham Lempel, Jacob Ziv, Martin Cohn: Apparatus and method for compressing data signals and restoring the compressed data signals. Sperry Corporation, Howard P Terry, Albert B Cooper, August 7, 1984: US04464650 (230 worldwide citation)

A compressor parses the input data stream into segments where each segment comprises a prefix and the next symbol in the data stream following the prefix. The prefix of a segment is the longest match with a previously parsed segment of the data stream. The compressor constructs a search tree data ba ...


2
Abraham Lempel, Gadiel Seroussi, Jeffrey P Tobin, Carl B Lantz: Apparatus and method for managing multiple dictionaries in content addressable memory based data compression. Hewlett Packard Corporation, December 13, 1994: US05373290 (121 worldwide citation)

A class of lossless data compression algorithms use a memory-based dictionary of finite size to facilitate the compression and decompression of data. To reduce the loss in data compression caused by dictionary resets, a standby dictionary is used to store a subset of encoded data entries previously ...


3
Gadiel Seroussi, Abraham Lempel: Lempel-Ziv compression scheme with enhanced adapation. Hewlett Packard Company, September 7, 1993: US05243341 (113 worldwide citation)

A class of lossless data compression algorithms use a memory-based dictionary of finite size to facilitate the compression and decompression of data. When the current dictionary (CD) fills up with encoded character strings, it is reset thereby losing the compression information previously contained ...


4
Gadiel Seroussi, Abraham Lempel: Compression using small dictionaries with applications to network packets. Hewlett Packard Company, February 14, 1995: US05389922 (98 worldwide citation)

The invention is a dictionary initialization scheme adaptive to changes in the type and structure of input data. The compression ratio is increased by minimizing the number of data entries used to represent single characters in the input data. By using fewer codes than what is normally used to repre ...


5
Gadiel Seroussi, Abraham Lempel: Method and apparatus for compressing and decompressing short blocks of data. Hewlett Packard Company, January 30, 1996: US05488365 (59 worldwide citation)

A scheme for compression of large sets of short blocks of data for storage in a storage medium, such as a read-only memory. Applications of the scheme include compression of fonts for printers, ROM disks in portable PCs, and others. These applications require random access to individual blocks, and ...


6
Kenzel P Manning, Martin Cohn, Abraham Lempel: Data recording and transmission apparatus utilizing non-consecutive zero coding. Sperry Rand Corporation, Howard P Terry, Albert B Cooper, December 7, 1976: US03996613 (31 worldwide citation)

The invention is described in the environment of a binary data magnetic recording and reproducing system and comprises a binary to non-consecutive zero code converter for encoding the input binary data into a non-consecutive zero code which, in turn, is recorded on the magnetic medium. In recording, ...


7
Martin Cohn, Terry A Welch, Abraham Lempel: Coset code generator for computer memory protection. Sperry Corporation, Howard P Terry, February 4, 1986: US04569052 (28 worldwide citation)

An apparatus for protecting computer memory utilizes a parity matrix to generate an n-k check bit signal of an extended linear (n,k,4) code from a k data bit signal. Exclusive-OR gates add the n-k check bit signal to an n-k tag bit signal selected from a predetermined class, to form, when concatenat ...


8
Gadiel Seroussi, Abraham Lempel: Method and apparatus for memory interleaving using an improved hashing scheme. Hewlett Packard Company, December 27, 1994: US05377340 (11 worldwide citation)

A novel memory hashing system is disclosed. The system converts an address into a hashed address of the form (B,C) where B is a module number in a multi-module memory system and C is an offset in the module. The system can be shown to have no pathological cases for any stride value less than some pr ...


9