Results 161 to 170 of about 1,801 (211)

Reversible data hiding and authentication scheme for encrypted image based on prediction error compression. [PDF]

Sci Rep
Ren F, Zhang Z, Jiang K, Zhang P, Yang T.   +4 more
europepmc   +1 more source

Codes, graphs and schemes from nonlinear functions.

Dam, E.R. van, Fon-der-Flaass, D.
core  

Some of the next articles are maybe not open access.

Related searches:

Algorithms for adaptive Huffman codes

Information Processing Letters, 1984
L'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
exaly   +2 more sources

On the maximum length of Huffman codes

Information Processing Letters, 1993
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
exaly   +3 more sources

Synchronizing codewords of q-ary Huffman codes

Discrete Mathematics, 1999
Some Huffman codes contain a special codeword called a synchronizing codeword, which resynchronizes the code whenever it is transmitted. We demonstrate properties of synchronizing codewords and, in particular, give some relationships between the length ...
S Perkins
exaly   +2 more sources

A new bound for the data expansion of Huffman codes

IEEE Transactions on Information Theory, 1997
In this paper we prove that the maximum data expansion ffi of Huffman codes is upper bounded by ffi ! 1:39. This bound improves on the previous best known upper bound ffi ! 2.
Roberto De Prisco
exaly   +1 more source

Maximal codeword lengths in Huffman codes

Computers and Mathematics With Applications, 2000
In this paper, we consider the following question about Huffman coding, which is an important technique for compressing data from a discrete source. If p is the smallest source probability, how long, in terms of p, can the longest Huffman codeword be? We
R J Mceliece
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

Fast decoding of the Huffman codes

Information Processing Letters, 1988
exaly   +2 more sources

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].
Rabia Arshad, Adeel Saleem, Danista Khan
openaire   +1 more source