Results 1 to 10 of about 28,330 (190)
A Characterization of Optimal Prefix Codes [PDF]
EntropyA 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]
EntropyTo 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
A quantum analog of Huffman coding [PDF]
IEEE Transactions on Information Theory, 1998 We analyze a generalization of Huffman coding to the quantum case. In particular, we notice various difficulties in using instantaneous codes for quantum communication.
Braunstein, Samuel L. +3 more
core +7 more sources
Huffman Codes And Self-information [PDF]
IEEE Transactions on Information Theory, 1976 In this paper the connection between the self-information of a source letter from a finite alphabet and its code-word length in a Huffman code is investigated. Consider the set of all independent finite alphabet sources which contain a source letter a of probability p .
Katona, Gyula, Nemetz, Tibor
core +3 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 +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
Existence, Uniqueness, and Optimality of Sibling-Property Codes for Infinite Sources [PDF]
, 2006 By definition Huffman codes only exist for finite sources, since the Huffman algorithm cannot be applied to an infinite source. On the other hand, Gallager's sibling property, which was introduced as a characterization of Huffman codes, extends naturally
Klimesh, Matthew, McEliece, Robert J.
core +1 more source
Computers & Mathematics with Applications, 2003 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Abdul Mannan, M., Kaykobad, M.
openaire +2 more sources