This paper represents the Algorithm for various Coding standards such as Huffman coding, Syntax based arithmetic coding and Context Adaptive Binary Arithmetic Coding used in MPEG, H.263 and H.264 respectively and their analysis. We found that average bit per symbol (average code word length) for Huffman coding is nearly equal to Entropy which is the basic requirement, for different bit rate PSN...

Given a probability vector, Huffman coding finds a corresponding prefix-free binary code that minimizes the mean codeword length. In this paper we explore situations in which the goals are different from those in Huffman coding. We explore a family of penalties (generalized means) proposed by Campbell [8], finding redundancy bounds for a common subfamily. We generalize an efficient algorithm fo...

In this paper, we propose a media-specific forward error correction (FEC) method based on Huffman coding for distributed speech recognition (DSR). In order to mitigate the performance degradation of DSR in noisy channel environments, the importance of each subvector for the DSR system is first explored. As a result, the first subvector information for the mel-frequency cepstral coefficients (MF...

Recently, arithmetic coding has attracted the attention of many scholars because of its high compression capability. Accordingly, in this paper, a method that adds secrecy to this well-known source code is proposed. Finite state arithmetic code is used as source code to add security. Its finite state machine characteristic is exploited to insert some random jumps during source coding process. I...

New concepts are defined, in particular the quasi-question or vertex with an outgoing arc of zero probability. A quasi-questionnaire is a probabilistic homogeneous (rooted) tree with quasiquestions. It is shown that every instantaneous code is a quasi-questionnaire with precise restrictive conditions; it may also be a questionnaire, without an arc of zero probability. Also, an approximation is ...

Image compression is a technique to reduce irrelevance and redundancy of the image data in order to be able to store or transmit data in an efficient form. This paper presents a peculiar Hybrid Transform genesis technique for image compression using two orthogonal transforms. The concept of hybrid transform is to combine the attributes of two different orthogonal transform wavelet to attain the...

Columnar Oriented Database is an enhance approach to service to service the needs of Business Intelligence. A Columnar Oriented Database Management system that stores content by columns rather than the row. This type of data differs from traditional database with regards to performance, storage requirements and easy to modification of the schema. One of the major advantage of column based datab...

This paper presents new lower and upper bounds for the compression rate of optimal binary prefix codes on memoryless sources according to various nonlinear codeword length objectives. Like the most well-known redundancy bounds for minimum (arithmetic) average redundancy coding — Huffman coding — these are in terms of a form of entropy and/or the probability of the most probable input symbol. Th...

For fixed t ≥ 2, we consider the class of representations of 1 as sum of unit fractions whose denominators are powers of t or equivalently the class of canonical compact t-ary Huffman codes or equivalently rooted t-ary plane “canonical” trees. We study the probabilistic behaviour of the height (limit distribution is shown to be normal), the number of distinct summands (normal distribution), the...

We present a new shape-coding approach, which decouples the shape information into two independent data sets, the skeleton and the distance of the boundary from the skeleton. The major benefit of this approach is that it allows a more flexible trade-off between accuracy of the approximation and bit-allocation cost, and thus, provides the possibility of better performance in the operational rate...