Results 171 to 180 of about 3,671 (229)

A Characterization of Optimal Prefix Codes. [PDF]

Entropy (Basel)
Congero S, Zeger K.
europepmc   +1 more source

Early Detection and Prevention of Ovarian Cancer. [PDF]

Cancers (Basel)
Montemorano L, Huffman L, Barroilhet L.
europepmc   +1 more source

High-resolution X-ray scanning with a diffuse Huffman-patterned probe to reduce radiation damage. [PDF]

J Synchrotron Radiat
Aminzadeh A, Kingston AM, Roberts L, Paganin DM, Petersen TC, Svalbe ID.   +5 more
europepmc   +1 more source

Condensation of Data and Knowledge for Network Traffic Classification: Techniques, Applications, and Open Issues. [PDF]

Sensors (Basel)
Zhao C, Liao LX, Chen G, Chao HC.
europepmc   +1 more source

A novel lossless encoding algorithm for data compression-genomics data as an exemplar. [PDF]

Front Bioinform
Al-Okaily A, Tbakhi A.
europepmc   +1 more source

Historical review: more than two decades understanding the genetic architecture of hemostasis and thrombosis. [PDF]

J Thromb Haemost
Sabater-Lleal M, Thibord F, de Vries PS, Huffman J, Wolberg AS, Lowenstein CJ, Morrison AC, Johnson AD, Smith NL.   +8 more
europepmc   +1 more source

Reversible Watermarking for Electrocardiogram Protection. [PDF]

Sensors (Basel)
Andreev P, Denisova A, Fedoseev V.
europepmc   +1 more source

Adaptive Compression and Reconstruction for Multidimensional Medical Image Data: A Hybrid Algorithm for Enhanced Image Quality. [PDF]

J Imaging Inform Med
David PF, Kothandapani SD, Pugalendhi GK.   +2 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Performance comparison of Huffman Coding and Double Huffman Coding

2016 Sixth International Conference on Innovative Computing Technology (INTECH), 2016
Huffman coding [11] is a most popular technique for generating prefix-free codes [7, 10]. It is an efficient algorithm in the field of source coding. It produces the lowest possible number of code symbols of a single source symbol [1]. Huffman coding is a most widely used lossless compression technique [2].
Danista Khan
exaly   +2 more sources

On breaking a Huffman code

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.
David W. Gillman, Mojdeh Mohtashemi, Ronald L. Rivest   +2 more
openaire   +2 more sources