Results 171 to 180 of about 53,193 (208)
Some of the next articles are maybe not open access.
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
IEEE Transactions on Information Theory, 1996
Summary: We examine the problem of deciphering a file that has been Huffman coded, but not otherwise encrypted. We find that a Huffman code can be surprisingly difficult to cryptanalyze. We present a detailed analysis of the situation for a three-symbol source alphabet and present some results for general finite alphabets.
Gillman, David W. +2 more
openaire +2 more sources
Summary: We examine the problem of deciphering a file that has been Huffman coded, but not otherwise encrypted. We find that a Huffman code can be surprisingly difficult to cryptanalyze. We present a detailed analysis of the situation for a three-symbol source alphabet and present some results for general finite alphabets.
Gillman, David W. +2 more
openaire +2 more sources
Kybernetes, 2013
Purpose – David Huffman, as a graduate student, earned his immortality by solving a problem that had stumped Claude Shannon, the creator of the field of information theory. How he saw the problem differently and the nature of his discovery have implications for how we get stuck, how we get unstuck, and how the internal ...
openaire +1 more source
Purpose – David Huffman, as a graduate student, earned his immortality by solving a problem that had stumped Claude Shannon, the creator of the field of information theory. How he saw the problem differently and the nature of his discovery have implications for how we get stuck, how we get unstuck, and how the internal ...
openaire +1 more source
Proceedings of the IEEE, 1973
A variable-word-length minimum-redundant code is described. It has the advantages of both the Huffman and Shannon-Fano codes in that it reduces transmission time, storage space, translation table space, and encoding and decoding times.
openaire +1 more source
A variable-word-length minimum-redundant code is described. It has the advantages of both the Huffman and Shannon-Fano codes in that it reduces transmission time, storage space, translation table space, and encoding and decoding times.
openaire +1 more source
Huffman coding in advanced audio coding standard
SPIE Proceedings, 2012This article presents several hardware architectures of Advanced Audio Coding (AAC) Huffman noiseless encoder, its optimisations and working implementation. Much attention has been paid to optimise the demand of hardware resources especially memory size. The aim of design was to get as short binary stream as possible in this standard.
openaire +1 more source
Mass Spectrometry-Based Techniques to Elucidate the Sugar Code
Chemical Reviews, 2022Márkó Grabarics +2 more
exaly
An expanded lexicon for the ubiquitin code
Nature Reviews Molecular Cell Biology, 2022Ivan Đikić, Brenda A Schulman
exaly