This paper presents a hardware-friendly solution for external memory bandwidth reduction focusing in the state-ofart video encoders, like H.264/AVC and HEVC. The proposed approach is based on reference frame compression using an adaptation of the traditional Huffman algorithm and is a lossless solution. This solution is entitled RFCAVLC8t (Reference Frame Context Adaptive Variable-Length Coder ...

Since the Internet is a medium for transporting sensitive data, privacy of message transported has become major concern. Image steganography prominent tool hiding data to ensure during transfer. An efficient system essential accomplish best embedding capacity and maintain other parameters at satisfying level. encryption systems provide secure flexible image conversion storage in transmission sy...

<span>In wireless sensor network (WSN), the high volume of observe and transmitted data among nodes make it requires to maintain security. Even though numerous secure transmission approaches designed over a network, an inadequate resource complex environment cause not able used in WSNs. Moreover, communication is big challenging problem WSNs especially for military application. This paper...

Efficient optimal prefix coding has long been accomplished via the Huffman algorithm. However, there is still room for improvement and exploration regarding variants of the Huffman problem. Length-limited Huffman coding, useful for many practical applications, is one such variant, for which codes are restricted to the set of codes in which none of the n codewords is longer than a given length, ...

Though Huffman codes [2,3,4,5,9] have shown their power in data compression, there are still some issues that are not noticed. In the present paper, we address the issue on the random property of compressed data via Huffman coding. Randomized computation is the only known method for many notoriously difficult #P-complete problems such as permanent, and some network reliability problems, etc [1,...

Targeted steganalysis aims at detecting hidden data embedded by a particular algorithm without any knowledge of the ‘cover’ image. In this paper we propose a novel approach for detecting Perturbed Quantization Steganography (PQ) by HFS (Huffman FR index Steganalysis) algorithm using a combination of Huffman Bit Code Length (HBCL) Statistics and File size to Resolution ratio (FR Index) which is ...

Huffman compression is a statistical, lossless, data compression algorithm that compresses data by assigning variable length codes to symbols, with the more frequently appearing symbols given shorter codes than the less. This work is a modification of the Huffman algorithm which permits uncompressed data to be decomposed into independently compressible and decompressible blocks, allowing for co...

This paper proposes a novel compression combined digital image watermarking scheme based on singular value replacement technique. Image compression is achieved using Huffman encoding technique. Huffman encoding is an entropy encoding algorithm offering lossless image compression. The proposed watermarking scheme combines Integer wavelet transform (IWT) with singular value decomposition (SVD). F...

Lossless text data compression is an important field as it significantly reduces storage requirement and communication cost. In this work, the focus is directed mainly to different file compression coding techniques and comparisons between them. Some memory efficient encoding schemes are analyzed and implemented in this work. They are: Shannon Fano Coding, Huffman Coding, Repeated Huffman Codin...