Results 171 to 180 of about 2,705,238 (250)
Some of the next articles are maybe not open access.
IEEE transactions on multimedia
With the development of data security and privacy requirements in the field of cloud computing, Reversible Data Hiding in Encrypted Images (RDHEI) in encryption domain has received increasing attention.
Chi Ji, Guangyong Gao, Yunqing Shi
semanticscholar +1 more source
With the development of data security and privacy requirements in the field of cloud computing, Reversible Data Hiding in Encrypted Images (RDHEI) in encryption domain has received increasing attention.
Chi Ji, Guangyong Gao, Yunqing Shi
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
Forward Looking Huffman Coding
Theory of Computing Systems, 2019zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Shmuel T. Klein +2 more
openaire +2 more sources
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
Weighted Adaptive Huffman Coding
2020 Data Compression Conference (DCC), 2020Huffman coding is known to be optimal in case the alphabet is known in advance, the set of codewords is fixed and each codeword consists of an integral number of bits. If one of these conditions is violated, optimality is not guaranteed. In the dynamic variant of Huffman coding the encoder and decoder maintain identical copies of the model; at each ...
Aharon Fruchtman +3 more
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
DCT based Enhanced Tchebichef Moment using Huffman Encoding Algorithm (ETMH)
2021 Third International Conference on Intelligent Communication Technologies and Virtual Mobile Networks (ICICV), 2021Data Compression includes enhancing a flood of images and dynamically rearranging codes. The consequent arrangement of compressed codes will be greater and simpler than the initial set of images.
D. S. Babu +3 more
semanticscholar +1 more source
CodeGemma: Open Code Models Based on Gemma
arXiv.orgThis paper introduces CodeGemma, a collection of specialized open code models built on top of Gemma, capable of a variety of code and natural language generation tasks. We release three model variants.
CodeGemma Team Heri Zhao +25 more
semanticscholar +1 more source
A High-Throughput VLSI Architecture Design of Canonical Huffman Encoder
IEEE Transactions on Circuits and Systems - II - Express Briefs, 2021In this brief, a high-throughput Huffman encoder VLSI architecture based on the Canonical Huffman method is proposed to improve the encoding throughput and decrease the encoding time required by the Huffman code word table construction process.
Zhenyu Shao +6 more
semanticscholar +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