In the last years, new semistatic word-based byte-oriented compressors, such as Plain and Tagged Huffman and the Dense Codes, have been used to improve the efficiency of text retrieval systems, while reducing the compressed collections to 30–35% of their original size. In this paper, we present a new semistatic compressor, called Pair-Based End-Tagged Dense Code (PETDC). PETDC compresses Englis...

Minimum redundancy coding (also known as Huffman coding) is one of the enduring techniques of data compression. Many efforts have been made to improve the efficiency of minimum redundancy coding, the majority based on the use of improved representations for explicit Huffman trees. In this paper, we examine how minimum redundancy coding can be implemented efficiently by divorcing coding from a c...

The JPEG standard technique involves three process mapping reduces interpixel redundancy, quantization, which is lossy process and entropy encoding, which is considered lossless process. Lossy JPEG compression is commonly used image compression technique. In the present paper a new hybrid technique has been introduced by combining the JPEG algorithm and Symbol Reduction Huffman technique for ac...

Lossy JPEG compression is a widely used compression technique. Normally the JPEG technique uses two process quantization, which is lossy process and entropy encoding, which is considered lossless process. In this paper, a new technique has been proposed by combining the JPEG algorithm and Symbol Reduction Huffman technique for achieving more compression ratio. The symbols reduction technique re...

Variable-length codes (VLCs) are generally employed to improve compression efficiency using data statistics. However, VLCs are weak to bit errors in noisy transmission environments such as wireless channel. Recently, reversible variable-length codes (RVLCs) have been introduced due to their capability of recovering information from corrupted compressed streams; hence, enhancing the robustness o...

Code mapping (CM) is an efficient technique for reversible data hiding (RDH) in JPEG images, which embeds by constructing a relationship between the used and unused codes bitstream. This study presents new framework designing CM-based RDH method. First, code strategy proposed to suppress file size expansion improve applicability. Based on our strategy, mapped are redefined creating Huffman tabl...

Algorithms for encoding and decoding finite strings over a finite alphabet are described. The coding operations are arithmetic involving rational numbers li as parameters such that Zi2"i 5 2". This coding technique requires no blocking, and the per-symbol length of the encoded string approaches the associated entropy within E . The coding speed is comparable to that of conventional coding metho...

We present an adaptive coding technique which is shown to achieve the optimal coding in the limit as the size of the text grows, while the data structures associated with the code only grow linearly with the text. The approach relies on Huffman codes which are generated relative to the context in which a particular character occurs. The Huffman codes themselves are inferred from the data that h...

Minimum redundancy coding (also known as Huffman coding) is one of the enduring techniques of data compression. Many efforts have been made to improve the efficiency of minimum redundancy coding, the majority based on the use of improved representations for explicit Huffman trees. In this paper, we examine how minimum redundancy coding can be implemented efficiently by divorcing coding from a c...

Medical signals and images need special treatment especially when the data become bigger and bigger. One of the treatment that will be considered in this experiment is about the data compression. ECG (Electro Cardio Graph) signals will create very big data when the signals were collected in a long period of time. Several methods can be used to compress the ECG data. In this experiment we used n...