Pattern matching in Huffman encoded texts

Shmuel T. Klein, Dana Shapira

Research output: Contribution to journalArticlepeer-review

28 Scopus citations


For a given text which has been encoded by a static Huffman code, the possibility of locating a given pattern directly in the compressed text is investigated. The main problem is one of synchronization, as an occurrence of the encoded pattern in the encoded text does not necessarily correspond to an occurrence of the pattern in the text. A simple algorithm is suggested which reduces the number of erroneously declared matches. The probability of such false matches is analyzed and empirically tested.

Original languageEnglish
Pages (from-to)829-841
Number of pages13
JournalInformation Processing and Management
Issue number4
StatePublished - Jul 2005
Externally publishedYes


  • Algorithms
  • Codes (symbols)
  • Data compression
  • Decoding
  • Encoding (symbols)
  • Probability
  • Compressed matching problem
  • Huffman code
  • Pattern matching


Dive into the research topics of 'Pattern matching in Huffman encoded texts'. Together they form a unique fingerprint.

Cite this