Results 181 to 190 of about 2,705,238 (250)
Some of the next articles are maybe not open access.
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
Compressed DNA Coding Using Minimum Variance Huffman Tree
IEEE Communications Letters, 2020DNA data storage is a highly emerging technology of storing large amount of data in a small volume for a long period of time. However, synthesis of DNA sequences come with a cost that depends on the number of nucleotides present in it.
Pooja Mishra +3 more
semanticscholar +1 more source
High-performance reversible data hiding in encrypted images with adaptive Huffman code
Digit. Signal Process., 2022Guangyong Gao +4 more
semanticscholar +1 more source
Synchronizing dynamic Huffman codes
Discrete Applied MathematicszbMATH Open Web Interface contents unavailable due to conflicting licenses.
Shmuel T. Klein +2 more
openaire +2 more sources
Algorithms for adaptive Huffman codes
Information Processing Letters, 1984L'algorithme d'Huffman permet de generer des codes a redondance minimum pour un ensemble fini de message a frequences de transmissions connues. On considere ici seulement les codes d'Huffman binaires. On decrit un algorithme qui peut etre generalise, mais le systeme binaire reste certainement le mieux adapte aux applications ...
Gordon V. Cormack, R.Nigel Horspool
openaire +1 more source
Self-synchronizing Huffman codes (Corresp.)
IEEE Transactions on Information Theory, 1984A problem associated with the use of variable-length source codes is that loss of synchronization may lead to extended errors in the decoded text. In this correspondence it is shown that some binary Huffman codes contain a codeword that resynchronizes the decoder regardless of the synchronization slippage preceding that codeword.
T. Ferguson, J. Rabinowitz
openaire +1 more source
1992
A mixed-radix code tree is a tree in which the degree of an internal node may depend on the level of the node. The problem of finding mixed-radix trees with minimum weighted path length is reduced to the construction of optimal alphabetic mixed-radix trees.
Ke-Chiang Chu, John Gill
openaire +1 more source
A mixed-radix code tree is a tree in which the degree of an internal node may depend on the level of the node. The problem of finding mixed-radix trees with minimum weighted path length is reduced to the construction of optimal alphabetic mixed-radix trees.
Ke-Chiang Chu, John Gill
openaire +1 more source
M-correlated dynamic Huffman code
Proceedings of TENCON '93. IEEE Region 10 International Conference on Computers, Communications and Automation, 2002The compression results of traditional variable length coding (VLC) are limited by the global entropy bound calculated from the statistics of entire source. Many entropy coder have been proposed for the purpose of approaching this compression bound as close as possible.
null Liang-Wei Lee +2 more
openaire +1 more source