Results 191 to 200 of about 2,484,228 (241)
Some of the next articles are maybe not open access.
Better Than Optimal Huffman Coding?
Data Compression Conference, 2019Huffman coding is known to be optimal, yet its dynamic version may yield smaller compressed files. The best known bound is that the number of bits used by dynamic Huffman coding in order to encode a message of n characters is at most larger by n bits ...
S. T. Klein, Shoham Saadia, Dana Shapira
semanticscholar +1 more source
Histogram modification based lossy image compression scheme using Huffman coding
International Conference on Electrical Engineering and Information Communication Technology, 2018Medical images produce massive volumes of data, and consequently, suitable image compression procedures require to save expense and time of storage and transportation sequentially. The requirement of transferring or storing satellite images is increasing
Md.Atiqur Rahman +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
A prediction-based lossless image compression procedure using dimension reduction and Huffman coding
Multimedia tools and applications, 2022Md.Atiqur Rahman, Mohamed Hamada
semanticscholar +1 more source
Hybrid AES-Huffman Coding for Secure Lossless Transmission
International Conference on Intelligent Computing, 2019Encoding is one of the effective ways to secure files, both for storing and sending files through the public network. Advanced Encryption Standard (AES) is one of the most powerful encryption algorithms that are widely used in various researches and ...
Mutia Rizky Ashila +4 more
semanticscholar +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