Title: On the usefulness of Fibonacci compression codes
Speaker: Shmuel Tomi Klein, Bar Ilan University
Date: Monday, June 23, 2008 12:00 - 1:30 pm
Location: DyDan Center, CoRE Bldg, Room 431, Rutgers University, Busch Campus, Piscataway, NJ
Abstract:
Recent publications advocate the use of various variable length codes for which each codeword consists of an integral number of bytes in compression applications using large alphabets. We show that another tradeoff with similar properties can be obtained by Fibonacci codes. These are fixed codeword sets, using binary representations of integers based on Fibonacci numbers of order m >= 2. Fibonacci codes have been used before, and this extends previous work presenting several novel features. In particular, the compression efficiency is analyzed and compared to that of dense codes, and various table-driven decoding routines are suggested.
Bio:
Prof Klein's research deals with Lossless Data Compression. Information Storage and Retrieval. Text Algorithms. Computational Linguistics. He has consulted on a variety of projects including: Data Compression Algorithms (DoubleDisk, Microsoft's DoubleSpace); Large Full-Text Information Retrieval Systems (Responsa Project, Trsor de la Langue Francaise); Software and in particular Data Compression Patents.