Results 11 to 20 of about 1,801 (211)

Approximating Huffman Codes in Parallel

Journal of Discrete Algorithms, 2002
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Piotr Berman, Marek Karpinski, Yakov Nekrich   +2 more
core   +5 more sources

A Characterization of Optimal Prefix Codes [PDF]

Entropy
A property of prefix codes called strong monotonicity is introduced, and it is proven that for a given source, a prefix code is optimal if and only if it is complete and strongly monotone.
Spencer Congero, Kenneth Zeger
doaj   +2 more sources

Multi-Party Controlled Semi-Quantum Dialogue Protocol Based on Hyperentangled Bell States [PDF]

Entropy
To solve the fundamental problem of excessive consumption of classical resources and the simultaneous security vulnerabilities in semi-quantum dialogue systems, a multi-party controlled semi-quantum dialogue protocol based on hyperentangled Bell states ...
Meng-Na Zhao, Ri-Gui Zhou, Yun-Hao Feng
doaj   +2 more sources

Anti-uniform Huffman codes

IET Communications, 2011
In this study, the authors consider the class of anti-uniform Huffman (AUH) codes. The authors derived tight lower and upper bounds on the average codeword length, entropy and redundancy of finite and infinite AUH codes in terms of the alphabet size of the source. These bounds are tighter than similar bounds.
Soheil Mohajer, Ali Kakhbod
openaire   +2 more sources

The Renyi redundancy of generalized Huffman codes [PDF]

IEEE Transactions on Information Theory, 1988
If optimality is measured by average codeword length, Huffman's algorithm gives optimal codes, and the redundancy can be measured as the difference between the average codeword length and Shannon's entropy. If the objective function is replaced by an exponentially weighted average, then a simple modification of Huffman's algorithm gives optimal codes ...
Blumer, Anselm C., McEliece, Robert J.
openaire   +5 more sources

Efficient Coding of the Embedded Signal in Steganographic Systems with Multiple Access [PDF]

Problems of the Regional Energetics, 2021
Today, steganographic systems with multiple access are of considerable importance. In such sys-tems, the orthogonal Walsh-Hadamard transform is most often used for multiplexing and divid-ing channels, which leads to the need for efficient coding of the ...
Kobozeva A.A., Kobozeva A.A.,
doaj   +1 more source

Generalization of Fibonacci Codes to the Non-Binary Case

IEEE Access, 2022
Motivated by expected technological developments in which the basic unit of storage might possibly be $d$ -ary elements, with $d > 2$ , and not just bits, we extend the traditional Fibonacci code to non-binary codes of higher order, and prove their ...
Shmuel T. Klein, Tamar C. Serebro, Dana Shapira   +2 more
doaj   +1 more source

Average Redundancy for Known Sources: Ubiquitous Trees in Source Coding [PDF]

Discrete Mathematics & Theoretical Computer Science, 2008
Analytic information theory aims at studying problems of information theory using analytic techniques of computer science and combinatorics. Following Hadamard's precept, these problems are tackled by complex analysis methods such as generating functions,
Wojciech Szpankowski
doaj   +1 more source

An Improved Image Compression Algorithm Using 2D DWT and PCA with Canonical Huffman Encoding

Entropy, 2023
Of late, image compression has become crucial due to the rising need for faster encoding and decoding. To achieve this objective, the present study proposes the use of canonical Huffman coding (CHC) as an entropy coder, which entails a lower decoding ...
Rajiv Ranjan, Prabhat Kumar
doaj   +1 more source

Applications of Non-Uniquely Decodable Codes to Privacy-Preserving High-Entropy Data Representation

Algorithms, 2019
Non-uniquely-decodable (non-UD) codes can be defined as the codes that cannot be uniquely decoded without additional disambiguation information. These are mainly the class of non–prefix–free codes, where a code-word can be a prefix of other(s)
Muhammed Oğuzhan Külekci, Yasin Öztürk   +1 more
doaj   +1 more source