Results 111 to 120 of about 1,801 (211)
Maximal codeword lengths in Huffman codes
, 1992 The following question about Huffman coding, which is an important technique for compressing data from a discrete source, is considered. If p is the smallest source probability, how long, in terms of p, can the longest Huffman codeword be?
Abu-Mostafa, Y. S., Mceliece, R. J.
core
Competitive Advantage of Huffman and Shannon-Fano Codes
For any finite discrete source, the competitive advantage of prefix code $C_1$ over prefix code $C_2$ is the probability $C_1$ produces a shorter codeword than $C_2$, minus the probability $C_2$ produces a shorter codeword than $C_1$.
Congero, Spencer, Zeger, Kenneth
core
, 2004 Motivated by a problem posed by Hamming in 1980, we define even codes. They are Huffman type prefix codes with the additional property of being able to detect the occurrence of an odd number of 1 bit errors i the message.
Szwarcfiter, Jayme L. +7 more
core +1 more source
A One-Pass Data Compression by Dynamic Dictionary Method Synchronized with Dynamic Huffman Codes [PDF]
, 1998 This paper proposes a new data compression algorithm. In the dynamic dictionary method, when building the dictionary from an original file, a large number of single characters appear. Each character is usually put into a file with fixed-length bits.
伊藤, 雅
core
Synchronizing codewords of q-ary Huffman codes
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 ...
core
Constructing constrained prefix-free codes
, 2020 The Optimal Coding problem is a well-known problem in information theory. The aim is for two parties to transmit information to each other through channels as efficiently as possible.
Ng, Kai Xiang
core
, 1989 . We present a Pascal implementation of the one-pass algorithm for constructing dynamic Huffman codes that is described and analyzed in a companion paper [Vitter, 1987].
Jeffrey Scott Vitter
core
Region based Huffman (RBH) compression technique with code interchange
, 2010 There were few research works are continuing to increase the performance of Huffman coding. The proposed paper is based on the new technique region based Huffman to increase the performance of the Huffman coding.
master administrator
core
, 1996 . We show that the space of all binary Huffman codes for a finite alphabet defines a lattice, ordered by the imbalance of the code trees. Representing code trees as path-length sequences, we show that the imbalance ordering is closely related to a ...
Prasad Ram, D. Stott Parker
core
What constitutes risk in implementation research? Perspectives from a qualitative key-informant study. [PDF]
Implement Sci CommunTetteh EK +7 more
europepmc +1 more source