Results 181 to 190 of about 2,484,228 (241)
Some of the next articles are maybe not open access.
Huffman Coding with Gap Arrays for GPU Acceleration
International Conference on Parallel Processing, 2020Huffman coding is a fundamental lossless data compression scheme used in many data compression file formats such as gzip, zip, png, and jpeg. Huffman encoding is easily parallelized, because all 8-bit symbols can be converted into codewords independently.
Naoya Yamamoto +5 more
semanticscholar +1 more source
DNA encryption algorithm based on Huffman coding
Journal of Discrete Mathematical Sciences and Cryptography, 2020Today, the transmission of hypersensitive data through public communication, poses a real problem for an unauthorized recipient which makes information security very important. The basic idea behind the proposed research work is to exploit the robustness
M. Meftah, A. Pacha, N. Hadj-Said
semanticscholar +1 more source
Journal of Algorithms, 1985
This note shows how to maintain a prefix code that remains optimum as the weights change. A Huffman tree with nonnegative integer weights can be represented in such a way that any weight w at level l can be increased or decreased by unity in O(l) steps, preserving minimality of the weighted path length.
openaire +1 more source
This note shows how to maintain a prefix code that remains optimum as the weights change. A Huffman tree with nonnegative integer weights can be represented in such a way that any weight w at level l can be increased or decreased by unity in O(l) steps, preserving minimality of the weighted path length.
openaire +1 more source
Performance comparison of Huffman Coding and Double Huffman Coding
2016 Sixth International Conference on Innovative Computing Technology (INTECH), 2016Huffman coding [11] is a most popular technique for generating prefix-free codes [7, 10]. It is an efficient algorithm in the field of source coding. It produces the lowest possible number of code symbols of a single source symbol [1]. Huffman coding is a most widely used lossless compression technique [2].
Rabia Arshad, Adeel Saleem, Danista Khan
openaire +1 more source
Proceedings of IEEE International Symposium on Information Theory, 2002
The efficiency of Huffman decoding is very important for an increased variety of implementations. A method called variable length enumerative table (VLET) decoding is presented which uses enumerative source coding principles to construct a Huffman decoder.
W. Van der Walt, H.C. Ferreira
openaire +1 more source
The efficiency of Huffman decoding is very important for an increased variety of implementations. A method called variable length enumerative table (VLET) decoding is presented which uses enumerative source coding principles to construct a Huffman decoder.
W. Van der Walt, H.C. Ferreira
openaire +1 more source
Minimum Variance Huffman Codes
SIAM Journal on Computing, 1982Huffman’s well-known coding method constructs a minimum redundancy code which minimizes the expected value of the word length. In this paper, we characterize the minimum redundancy code with the minimum variance of the word length. An algorithm is given to construct such a code. It is shown that the code is in a certain sense unique.
openaire +2 more sources
Research on image compression technology based on Huffman coding
Journal of Visual Communication and Image Representation, 2019Shuyun Yuan, Jianbo Hu
exaly +2 more sources
IEEE Transactions on Image Processing, 2003
It is a well observed characteristic that when a DCT block is traversed in the zigzag order, the AC coefficients generally decrease in size and the run-length of zero coefficients increase in number. This article presents a minor modification to the Huffman coding of the JPEG baseline compression algorithm to exploit this redundancy.
openaire +2 more sources
It is a well observed characteristic that when a DCT block is traversed in the zigzag order, the AC coefficients generally decrease in size and the run-length of zero coefficients increase in number. This article presents a minor modification to the Huffman coding of the JPEG baseline compression algorithm to exploit this redundancy.
openaire +2 more sources
Optimal Prefix Codes And Huffman Codes
International Journal of Computer Mathematics, 2003Existence of the optimal prefix codes is shown in this paper. Relationship between the optimal prefix code and the Huffman code is also discussed. We prove that all Huffman codes are optimal prefix codes and conversely optimal prefix codes need not be Huffman codes.
Long, D., Jia, W., Li, M.
openaire +1 more source
HEliOS: huffman coding based lightweight encryption scheme for data transmission
International Conference on Mobile and Ubiquitous Systems: Networking and Services, 2019Demand for fast data sharing among smart devices is rapidly increasing. This trend creates challenges towards ensuring essential security for online shared data while maintaining the resource usage at a reasonable level. Existing research studies attempt
Mazharul Islam +4 more
semanticscholar +1 more source