Past research in the field of cryptography has not given much consideration to arithmetic coding as a feasible encryption technique. Over the past few years, while arithmetic coding has still been the focus of a lot of intense research, studies have proven compression-specific arithmetic coding to be largely unsuitable for encryption. This is in spite of the large size of the model that arithme...

This paper presents a new method of lossless data compression called LZPP, being an advanced modification of the well-known algorithm LZSS [1]. It introduces improvements of the LZ family algorithms [2, 3], such as the use of a special coding of two and three byte matches, use of an auxiliary entropy coder and new criteria of symbol exclusions. Minimization of the data compression ratio (bpc) h...

This paper outlines a new standard video compression technology: MPEG-4. We propose a very efficient coding scheme using the one of compression tools of MPEG-4 “Sprite coding”. We first introduce MPEG-4 visual “Profiles”, which are sets of tools (technical elements) that realize certain types of applications. Among these “Profiles”, “Main Profile” is capable of using “Sprites” i.e. a unified ba...

We consider the problem of data compression with side information at the decoder and propose novel algorithms for quantization of the side information. These methods build quantizers that minimize the rate at which the source can be encoded with a constraint on the entropy of the quantized side information. We study relationships between our methods and those of context quantization used for im...

Neural networks are promising tools for data compression without loss of information. We combine predictive neural nets and statistical coding techniques to compress text les. We apply our methods to certain short newspaper articles and obtain compression ratios exceeding those of widely used Lempel-Ziv algorithms (which are the basis of the UNIX functions \compress" and \gzip"). Our methods' m...

A system for selecting a single best view image chip from an IR video sequence and compression of the chip for transmission is presented. Moving object detection was done using the algorithm described in 1]. Eigenspace classiication has been implemented for best view selection. Fast algorithms for image chip compression have been developed in the wavelet domain by combining a non-iterative zero...

The paper presents a binarization scheme that converts non-binary data into a set of binary strings. At present, there are many binarization algorithms, but they are optimal for only specific probability distributions of the data source. Overcoming the problem, it is shown in this paper that the presented binarization scheme conserves the entropy of the original data having any probability dist...

We continue developing the information theory of structured data. In this paper, we take up d-ary trees (d ≥ 2) and trees with unrestricted degree. We rst compute the entropy which gives us the fundamental lower bound on compression of such trees. Then we present e cient compression algorithms based on arithmetic encoding that achieve the entropy within a constant number of bits. A naïve implem...

Arithmetic coding for data compression has gained widespread acceptance for optimum compression when used in a suitable model. The "traditional" hard bit based decoding suffers from severe loss of data when errors are present in the received bitstream. In this paper, heuristic-search based algorithms are introduced for the decoding of arithmetic coded bitstreams. They utilize both channel "soft...

In this paper, we use Kolmogorov complexity and compression algorithms to study DOS-DNA (DOS: de-ned ordered sequence). This approach gives quantitative and qualitative explanations of the regularities of apparently regular regions. We present the problem of the coding of approximate multiple tandem repeats in order to obtain compression. Then we describe an algorithm that allows to nd eecientl...