Variants of Huffman codes where words are taken as the source symbols are currently the
most attractive choices to compress natural language text databases. In particular, Tagged …

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 …

This work presents (s, c)-Dense Code, a new method for compressing natural language
texts. This technique is a generalization of a previous compression technique called End …

Nowadays, people are using multimedia tools that store multiple types of data in a large
amount. The information retrieval from such a vast amount is not an easy task. So, document …

Byte codes have a number of properties that make them attractive for practical compression
systems: they are relatively easy to construct; they decode quickly; and they can be …

We introduce a dynamic data structure for the compact representation of binary relations R⊆
A× B. The data structure is a dynamic variant of the k 2-tree, a static compact representation …

Let m 1, m 2,..., mt be a fixed set of natural integers given in ascending order. A multi-
delimiter code D m1,..., mt consists of t words of the form 1 mi 0 and all other binary words …

An enhanced version of a recently introduced family of variable length binary codes with
multiple pattern delimiters is presented and discussed. These codes are complete …

Most of the countries use bi-script documents. This is because every country uses its own
national language and English as second/foreign language. Therefore, bi-lingual document …

Given a sequence S of n symbols over some alphabet Σ, we develop a new compression
method that is (i) very simple to implement;(ii) provides O (1) time random access to any …