Results 161 to 170 of about 2,705,238 (250)
Efficient IP address retrieval using a novel octet based encoding technique for high speed lookup to improve network performance. [PDF]
Sci RepSonai V +4 more
europepmc +1 more source
Learning-based short text compression using BERT models. [PDF]
PeerJ Comput SciÖztürk E, Mesut A.
europepmc +1 more source
Trends in Epidemiology and Treatment of Humerus Fractures in the United States, 2017-2022. [PDF]
CureusGhayyad K +4 more
europepmc +1 more source
Learning to compress electrocardiogram signals on a quick response code. [PDF]
Sci RepSrivastava A, Dewan D, Patra A, Sheet D.
europepmc +1 more source
Deposition of metal-organic frameworks within a porous protein crystal superstructure.
J Mater Chem BDeRoo JB +7 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
ACM Computing Surveys, 2014
Huffman’s algorithm for computing minimum-redundancy prefix-free codes has almost legendary status in the computing disciplines. Its elegant blend of simplicity and applicability has made it a favorite example in algorithms courses, and as a result it is perhaps one of the most commonly implemented algorithmic techniques.
Alistair Moffat
openaire +3 more sources
Huffman’s algorithm for computing minimum-redundancy prefix-free codes has almost legendary status in the computing disciplines. Its elegant blend of simplicity and applicability has made it a favorite example in algorithms courses, and as a result it is perhaps one of the most commonly implemented algorithmic techniques.
Alistair Moffat
openaire +3 more sources
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 +3 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 +3 more sources
AHCM: Adaptive Huffman Code Mapping for Audio Steganography Based on Psychoacoustic Model
IEEE Transactions on Information Forensics and Security, 2019Most current audio steganographic methods are content non-adaptive which have poor security and low embedding capacity. This paper proposes a generalized adaptive Huffman code mapping (AHCM) framework for obtaining higher secure payload.
Xiaowei Yi +4 more
semanticscholar +1 more source
Huffman-code based retrieval for encrypted JPEG images
Journal of Visual Communication and Image Representation, 2019This paper proposes a retrieval scheme for encrypted JPEG images, based on Huffman code in the JPEG bitstream. Three parties are involved: content owner, cloud server, and authorized user.
Haihua Liang, Xinpeng Zhang, Hang Cheng
semanticscholar +1 more source