On improving Tunstall codes

Shmuel T. Klein, Dana Shapira

Research output: Contribution to journalArticlepeer-review

14 Scopus citations


Though many compression methods are based on the use of variable length codes, there has recently been a trend to search for alternatives in which the lengths of the codewords are more restricted, which can have useful applications, such as easier processing and fast decoding. This paper explores the construction of variable-to-fixed length codes, which have been suggested long ago by Tunstall. Using new heuristics based on suffix trees, the performance of Tunstall codes can in some cases be improved by more than 40%.

Original languageEnglish
Pages (from-to)777-785
Number of pages9
JournalInformation Processing and Management
Issue number5
StatePublished - Sep 2011


  • Data compression
  • Huffman codes
  • Suffix trees
  • Tunstall codes


Dive into the research topics of 'On improving Tunstall codes'. Together they form a unique fingerprint.

Cite this