Results 201 to 210 of about 2,484,228 (241)
Some of the next articles are maybe not open access.
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
Journal of Visual Communication and Image Representation, 2021
Chih-Cheng Chen +2 more
semanticscholar +1 more source
Chih-Cheng Chen +2 more
semanticscholar +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
Canonical Huffman Coding Based Image Compression using Wavelet
Wireless personal communications, 2020R. Ranjan
semanticscholar +1 more source
An enhanced Huffman-PSO based image optimization algorithm for image steganography
Genetic Programming and Evolvable Machines, 2021Neha Sharma
exaly
Huffman coding-based data reduction and quadristego logic for secure image steganography
Engineering Science and Technology, an International JournalIrsyad Fikriansyah Ramadhan +3 more
semanticscholar +1 more source