we extend some results of Lempel and Restive on multiset decipherable codes to set decipherable codes. @ 2001 Elsevier Science Ltd. All rights reserved. Keywords-Codes, Unique decipherability, Multiset decipherability, Dominoes, Set decipherability.

The Lempel-Ziv algorithms are well-known dynamic dictionary algorithms of use in data compression. The talk shows how analytic models originally developed for the analysis of tries and digital search trees may be used to characterize their compression characteristics.

[11] P. Lux, " A novel set of closed orthogonal functions for picture coding, " Arch. [13] H. Blume and A. Fand, " Reversible and irreversible image data compression using the S-transform and Lempel-Ziv coding, " in SPIE vol.

Recent advances in biotechnology and web technology are generating huge collections of similar strings. People now face the problem of storing them compactly while supporting fast pattern searching. One compression scheme called relative Lempel-Ziv compression uses textual substitutions from a reference text as follows: Given a (large) set S of strings, represent each string in S as a concatena...

Methods for discerning and measuring Kolmogorov Complexity are discussed and their relationships explored. A computationally efficient method of using Lempel Ziv 78 Universal compression algorithm to estimate complexity is introduced. 1 Abstract—Methods for discerning and measuring Kolmogorov Complexity are discussed and their relationships explored. A computationally efficient method of using ...

A compressed full-text self-index for a text T is a data structure requiring reduced space and able of searching for patterns P in T . Furthermore, the structure can reproduce any substring of T , thus it actually replaces T . Despite the explosion of interest on self-indexes in recent years, there has not been much progress on search functionalities beyond the basic exact search. In this paper...

We consider a simplified version of a solvable model by Mandal and Jarzynski, which constructively demonstrates the interplay between work extraction and the increase of the Shannon entropy of an information reservoir which is in contact with a physical system. We extend Mandal and Jarzynski’s main findings in several directions: First, we allow sequences of correlated bits rather than just ind...