Startseite | Themenabende | Mailingliste | Pläne | Links | GnuPG-Schlüssel
http://l2.espacenet.com/espacenet/viewer?PN=EP0280549&CY=ep&LG=en&DB=EPD

Claims

  1. A method of compressing text data which comprises searching a dictionary (15) for an input word and producing a corresponding codeword if it is found in the dictionary (15) characterized by calculating the occurrence frequency of the input word, and if that frequency rises assigning a shorter codeword to the input word.
  2. A method according to claim 1 in which a new word is entered in the dictionary (15).
  3. A method according to claim 1 or claim 2 in which the dictionary (15) contrains pseudowords, and if the searching finds no ordinary word, dividing the input word into pseudowords of fixed length and searching for the pseudowords.
  4. A method according to claim 3 in which the pseudowords are one or two characters in length.
  5. A method according to any preceding claim in which a word or pseudoword having a low occurrence count is removed from the dictionary (15).
  6. Apparatus for compressing text data which comprises means (14) for searching a dictionary (15) for an input word and sending a corresponding codeword to a modulator (18) characterized by an occurrence frequency calculator (17) for the input word means for assigning a shorter codeword to the input word if its occurrence frequency rises.
  7. Apparatus according to claim 6 including means (16) for entering a new word.
  8. Apparatus according to claim 6 or claim 7 including means (315) for dividing an input word into pseudowords.
zip ZIPDATEI DATEI[EN] ...
  

This short command executes the huffman algorithm und violates claim 4 this way. Futhermore, it violates claims 3, 2 and 1.

Startseite | Themenabende | Mailingliste | Pläne | Links | GnuPG-Schlüssel
Letzte Änderung: 11. Januar 2003
Benedikt Wildenhain, patente@benedikt-wildenhain.de