Data compression with dynamically compiled dictionary
US5253325A · kind A · utility
191Cited by
2References
5Claims
0Family size
Assignee
Inventor
Key dates
| Filing date | Jun 25, 1991 |
| Grant date | Oct 12, 1993 |
| Priority date | — |
| Expiry date | Jun 25, 2011 |
Classification
- Technology area (CPC H)Electricity
- CPC primaryH03M7/3084
- WIPO fieldBasic communication processes
- WIPO sectorElectrical engineering
Abstract
A data compression system in which a dictionary stored strings of characters and an encoder matches the longest of the stored string with a current string of a data stream input to the encoder. The index of the longest matched stored string is output by the encoder and the dictionary is updated by a new string consisting of the previous match concatenated with the first two characters only of the present match. If the present match has only one or two characters, it is added without reduction.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.