D. A. Huffman. A method for the construction of minimum redundancy codes. Proceedings of the IRE, 40:1098--1101, 1952. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Constructing Trees in Parallel - Atallah, Kosaraju, Larmore, Miller.. (1989) (12 citations) (Correct)
....that a message can be decomposed in code word in only one way they are uniquely decipherable. It is interesting to point out that Kraft and McMillan proved that for any code which is uniquely decipherable there is always a prefix code with the same average word length [13] In 1952, Huffman [9] gave an elegant sequential algorithm which can generate an optimal prefix code in O(n log n) time. If the probabilities are presorted then his algorithm is actually linear time [11] Using parallel dynamic programming, Kosaraju and Teng [18] independently, gave the first NC algorithm for the ....
D. A. Huffman. A method for the construction of minimum redundancy codes. Proc. IRE, 40:1098-- 1101, 1952.
Packet-based Input Test Data Compression Techniques - Erik Volkerink Ajay (2002) (4 citations) (Correct)
....group sizes (i.e. group sizes that occur rarely don t need to be encoded directly with own code words) 3.3. 2 Variable length encoding Instead of fixed length code words, Huffman codes can be used to attach shorter code words to group sizes and or group types that occur with a higher probability [15]. The codes can be derived using a Huffman tree. By again only directly encoding a limited number of group sizes, the hardware implementation can be kept simple. Table 3 gives an example of 8 Huffman codes. Table 3: Binary encoding techniques for the group size Golomb Rice Size Prop. ....
D.A. Huffman, "A Method for the Construction of Minimum Redundancy Codes", Proc. of IRE, Vol.40, No.9, pp. 1098-1101, 1952.
A Reliable LZ Data Compressor on Reconfigurable Coprocessors - Huang, Saxena, McCluskey (2000) (4 citations) (Correct)
....optimizing resource utilization in communication and storage systems. Redundant information inherent in the source data is removed in a way that there is no loss after reconstruction. Many lossless data compression algorithms for achieving this objective have been proposed, such as Huffman coding [Huffman 52] Lempel Ziv (LZ) data compression algorithms [Ziv 77, 78] and arithmetic coding [Rissanen 76] In general, data size reduction is achieved by encoding long but frequently encountered strings into shorter codewords with the help of a dictionary. In Huffman and arithmetic coding techniques, ....
Huffman, D. A., "A Method for the Construction of Minimum Redundancy Codes," Proc. IRE, Vol. 40, pp. 10981102, 1952.
XGRIND: A Query-friendly XML Compressor - Pankaj Tolani Jayant (2002) (18 citations) (Correct)
....on the above observations, we propose in this paper a new XML compression tool, called XGrind, that directly supports queries in the compressed domain. It compresses at the granularity of individual element attribute values using a simple context free compression scheme based on Huffman coding [8]. This means that exact match and prefix match user queries can be entirely executed directly on the compressed document, with decompression restricted to only the final results provided to the user. Further, range or partial match queries require on the fly decompression of only those ....
....are pattern based. For Huffman and Arithmetic, both adaptive and non adaptive flavors are available, whereas both the LZ encoders are adaptive. The compressors evaluated in this paper utilize the Huffman and LZ77 techniques, whose details are described next. 2.1. Huffman Coding In Huffman coding [8], the most frequent characters in the input data are assigned shorter codes and the less frequent characters are assigned longer codes. The longer codes are constructed such that the shorter codes do not appear as prefixes. In particular, a tree is constructed with the characters of the input ....
D. Huffman, "A Method for Construction of Minimum-Redundancy Codes", Proc. of IRE, September 1952.
Improving Chinese Storing Text Retrieval Systems' Security .. - Long, Jia, Li, Au, Su (Correct)
....stage in JPEG [15] Huffman codes belongs into a family of codes with a variable length not a fixed length. That means that individual letter which makes a file is encoded with bit sequences that have distinct length. This characteristic of the code words helps to decrease the amount of redundancy [6, 14, 16, 21] in message data i.e. it makes data compression possible. Decreasing of redundancy in data by Huffman codes is based on the fact that distinct letters have distinct probabilities of incidence. This fact helps to create such code words, which really contribute to decreasing of redundancy i.e. to ....
....has a smaller average code word length. A maximal prefix code is called optimal for a source alphabet S if no other maximal prefix code has a smaller average code word length. Huffman published a method for constructing highly an efficient coding (or encoding) for finite source alphabets in 1952 [6]. This method is known as the Huffman coding (or the Huffman s algorithm) and the corresponding code of a Huffman coding (or the code generated by the Huffman s algorithm) is said to be the Huffman code [4,14 15] 2. Optimal Maximal Prefix Coding Schemes First, it is proven that existence of the ....
[Article contains additional citation context not shown here]
D. A. Huffman, A Method for the Construction of Minimum Redundancy Codes, In Proc. IRE 40(1951), 1098-1101.
Reducing Test Data Volume Using LFSR Reseeding with Seed.. - Krishna And Nur (2002) (5 citations) (Correct)
....occur most frequently have a smaller number of bits, and those that occur least frequently to have a larger number of bits. This minimizes the average length of a codeword. The goal is to obtain a coded representation of the original data set that has the smallest number of bits. A Huffman code [Huffman 52] is an optimal statistical code that is proven to provide the shortest average codeword length among all uniquely decodable variable length codes. An important property of Huffman codes is that they are prefix free. No codeword is a prefix of another codeword. This greatly simplifies the decoding ....
....to make all the blocks equal size) The frequency of occurrence of the codewords can be skewed by intelligent selection of the seeds from the solution space of the linear equations as will be described in Sec. 5. Given the frequency of each codeword, an optimal Huffman code can be constructed [Huffman 52] A decoder for the Huffman code can be implemented with a finite state machine (FSM) having 2 b 1 states for a b bit block size. If the block size is chosen to be small (e.g. 4 or 5 bits blocks) then the Huffman decoder requires very little overhead. Alternatively, larger block sizes can be ....
[Article contains additional citation context not shown here]
Huffman, D.A., "A Method for the Construction of Minimum Redundancy Codes," Proc. of IRE, Vol. 40, No. 9, pp. 1098-1101, Sep. 1952.
Selective Application of Burrows-Wheeler Transformation .. - Baik, Ha, Yook, Shin.. (Correct)
....run length coding (RLC) first and then a variable length coding (VLC) RLC encodes the run of an item into a two tuple, the item and its run length. To further compress the data, JPEG employs a VLC such as Huffman coding and arithmetic coding, which exploits repetition of twotuples encoded by RLC [2, 3, 4]. We observed that identical strings often appear in contiguous blocks of the data for simple images. However, the JPEG entropy encoding, which aims to exploit repetition of data within a block boundary, does not take the advantage of repetition of strings across block boundaries. In our previous ....
. David A. Huffman, "A Method for the Construction of Minimum-Redundancy Codes," Proc. IRE, pp. 1098-1101, September 1952.
Group Testing for Image Compression - Hong (2000) (4 citations) (Correct)
....adjacent DC coefficients are stored as symbols. For the AC coefficients, a simple quantization scheme is used to store them; there is a standard table dictating the quantization step size for each coefficient based on its position in the block. The symbols are entropy coded with a Huffman code [23], which is a well known block tovariable length code (see section 3.3.2) Due to the advances in image compression and the old age of the JPEG standard, it is significantly worse than wavelet based zerotree coders and other state of the art coders in terms of rate distortion performance. EZ DCT ....
D. A. Huffman. A method for the construction of minimum redundancy codes. In Proceedings IRE, volume 40, pages 1098--1101, 1962.
Compression of Digital Holograms for.. - Naughton, Frauel, .. (2002) Self-citation (Huffman) (Correct)
No context found.
D. A. Huffman, "A method for the construction of minimum redundancy codes," Proc. IRE 40, 1098 --1101 #1952#.
Mixed RL-Huffman Encoding for Power Reduction and.. - Tehranipour.. Self-citation (Huffman) (Correct)
No context found.
D. Huffman, "A Method for the Construction of Minimum Redundancy Codes," in Proc. IRE, vol. 40, no. 9, pp. 1098-1101, 1952.
RL-Huffman Encoding for Test Compression and Power.. - Nourani, Tehranipour (1995) Self-citation (Huffman) (Correct)
No context found.
D. Huffman, "A Method for the Construction of Minimum Redundancy Codes," in Proc. IRE, vol. 40, no. 9, pp. 1098-1101, 1952.
Approximating Huffman Codes in Parallel - Berman, Karpinski, Nekrich (2002) Self-citation (Huffman) (Correct)
No context found.
Huffman, D. A., A method for construction of minimum redundancy codes, Proc. IRE,40 (1951), pp. 1098--1101.
Adding Compression to a Full-Text Retrieval System - Zobel, Moffat (1988) (16 citations) Self-citation (Huffman) (Correct)
No context found.
D.A. Huffman, `A method for the construction of minimum redundancy codes', Proc. IRE, 40, (9), 1098--1101, (September 1952).
Approximating Huffman Codes in Parallel - Berman, Karpinski, Nekrich (2002) Self-citation (Huffman) (Correct)
No context found.
Huffman, D. A., A method for construction of minimum redundancy codes, Proc. IRE,40 (1951), pp. 1098--1101.
An Efficient Test Vector Compression Scheme Using.. - Jas, Ghosh-Dastidar, .. (2003) (3 citations) Self-citation (Huffman) (Correct)
....occur most frequently have a smaller number of bits, and those that occur least frequently to have a larger number of bits. This minimizes the average length of a codeword. The goal is to obtain a coded representation of the original data set that has the smallest number of bits. A Huffman code [18] is an optimal statistical code that is proven to provide the shortest average codeword length among all uniquely decodable variable length codes. A Huffman code is obtained by constructing a Huffman tree. The path from the root to each leaf gives the codeword for the binary string corresponding ....
D. A. Huffman, "A Method for the construction of minimum redundancy codes," in Proc. IRE, vol. 40, 1952, pp. 1098--1101.
Unknown - (Correct)
No context found.
D. A. Huffman. A method for the construction of minimum redundancy codes. Proceedings of the IRE, 40:1098--1101, 1952.
The Implementation and Performance of Compressed.. - Westmann, Kossmann.. (1998) (4 citations) (Correct)
No context found.
D. Huffman. A method for the construction of minimum-redundancy codes. Proc. IRE, 40(9):1098--1101, September 1952.
Unknown - Chi-Ying Tsui Received (Correct)
No context found.
D. A. Huffman. A method for the construction of minimum redundancy codes. In Proceedings of the IRE, volume 40, pages 1098--1101, September 1952.
Alphabetic Trees: Theory and Applications in Layout-Driven.. - Vaishnav, Pedram (Correct)
No context found.
D. A. Huffman. A method for the construction of minimum redundancy codes. In Proceedings of the IRE, volume 40, pages 1098--1101, September 1952.
Information Processing Letters 97 (2006) 133--137 - Www Elsevier Com (Correct)
No context found.
D.A. Huffman, A method for the construction of minimum redundancy codes, Proc. IERE 40 (9) (1952) 1098--1101.
Security in Multiagent Systems By Policy Randomization - Praveen Paruchuri Milind (Correct)
No context found.
D. A. Huffman. A method for the construction of minimum redundancy codes. In Proc. IRE 40, 1952.
Disposal of Explosive Ordnances by Use of - Bimanual Haptic Telepresence (Correct)
No context found.
D.A. Huffman, A Method for the Construction of Minimum-Redundancy Codes. In Proc. of IRE, pp. 1098-1101, 1952.
Proof Optimization Using Lemma Extraction - Rahul George Necula (Correct)
No context found.
Huffman, D. A. A method for construction of minimum redundancy codes. In Proc. of the IEEE (1952), vol. 40, pp. 1098-1101.
Dynamic Shannon Coding - Travis Gagie Student (2004) (Correct)
No context found.
D. A. Huffman, "A method for the construction of minimum redundancy codes," Proceedings of the IERE, vol. 40, pp. 1098--1101, 1952.
XGRIND: A Query-friendly XML Compressor - Pankaj Tolani Jayant (2002) (18 citations) (Correct)
No context found.
D. Huffman, "A Method for Construction of Minimum-Redundancy Codes", Proc. of IRE, September 1952.
Location-based Node IDs: Enabling Explicit Locality in DHTs - Shuheng Zhou Gregory (2003) (Correct)
No context found.
D. A. Huffman. A method for the construction of minimum-redundancy codes. Published as Proceedings of the IRE, 40:1098--1101, 1952.
Configuration Bitstream Compression for Dynamically - Ju (Correct)
No context found.
D. A. Huffman. A method for the construction of minimum redundancy codes. Proceedings of the Institute of Radio Engineers 40, 1952.
Balancing Locality and Randomness in DHTs - Shuheng Zhou Gregory (Correct)
No context found.
D. A. Huffman. A method for the construction of minimum-redundancy codes. Published as Proceedings of the IRE, 40:1098--1101, 1952.
Almost All Complete Binary Prefix Codes Have a.. - Freiling.. (2003) (Correct)
No context found.
D. A. Huffman, "A method for the construction of minimum-redundancy codes," Proc. IRE, vol. 40, pp. 1098--1101, Sept. 1952.
Construction of Symmetrical Reversible Variable Length Codes.. - Tseng, Chang (2003) (Correct)
No context found.
Huffman, D. A. (1952) A method for the construction of minimum redundancy codes. Proc. IRE, 40, 1098--1101.
Approximating Optimal Binary Trees in Parallel - Berman, Karpinski, Nekrich (2001) (Correct)
No context found.
Huffman, D. A., A method for construction of minimum redundancy codes, Proc. IRE,40 (1951), pp. 1098--1101. 10
Data Management Techniques To Handle Large Data Arrays In Hdf - Velamparampil (1998) (1 citation) (Correct)
No context found.
D. A. Huffman. A method for the construction of minimum-redundancy codes. Proceedings of the IRE, 40(9):1098--1101, September 1952.
Location-based Node IDs: Enabling Explicit Locality in DHTs - Zhou, Ganger, Steenkiste (2003) (Correct)
No context found.
D. A. Huffman. A method for the construction of minimum-redundancy codes. Published as Proceedings of the IRE, 40:1098--1101, 1952.
XQueC: Pushing Queries to Compressed XML Data - Andrei Arion Inria (2003) (1 citation) (Correct)
No context found.
D. A. Huffman. A Method for Construction of MinimumRedundancy Codes. In Proc. of the IRE, 1952.
The Implementation and Performance of Compressed.. - Westmann, Kossmann.. (1998) (4 citations) (Correct)
No context found.
D. Huffman. A method for the construction of minimum-redundancy codes. Proc. IRE, 40(9):1098--1101, September 1952.
High Performance Compression of Visual Information - A .. - Egger, Fleury.. (1999) (5 citations) (Correct)
No context found.
David A. Huffman, "A method for the construction of minimum-redundancy codes," Proceedings of IRE, vol. 40, no. 9, pp. 1098--1101, 1952.
The LOCO-I Lossless Image Compression Algorithm.. - Weinberger, Seroussi, .. (2000) (28 citations) (Correct)
No context found.
D. Huffman, "A method for the construction of minimum redundancy codes," Proc. IRE, vol. 40, pp. 1098--1101, 1952.
Cryptography in Data Compression - Wang (Correct)
No context found.
D.A. Huffman, A Method for the Construction of Minimum-Redundancy Codes, in: Proc. IRE, 40, 9 (Sept.), 1952, pp. 1098-1101.
Engineering the Compression of Massive Tables: An.. - Buchsbaum, Caldwell, al. (2000) (7 citations) (Correct)
No context found.
D. A. Huffman. A method for the construction of minimumredundancy codes. Proc. IRE, 49(9):1098--101, 1952.
Next-Generation Information Retrieval: Integrating Document and.. - Bremer (2003) (Correct)
No context found.
D.A. Huffman. A Method for the Construction of Minimum-Redundancy Codes. In Proceedings of the Institute for Radio Engineers, volume 22, pages 1098--1101, 1952.
Network Working Group P. Deutsch Request for Comments: 1951.. - Status Of This (Correct)
No context found.
Huffman, D. A., "A Method for the Construction of Minimum Redundancy Codes", Proceedings of the Institute of Radio Engineers, September 1952, Volume 40, Number 9, pp. 1098-1101.
Fast Prefix Code Processing - Pajarola (2003) (Correct)
No context found.
D. A. Huffman. A method for the construction of minimum redundancy codes. In Proc. Inst. Electr. Radio Eng., pages 1098--1101, 1952.
Improving Information Retrieval System Security via an Optimal.. - Long (2002) (Correct)
No context found.
Huffman, D.A.: A Method for the Construction of Minimum-Redundancy Codes. Proc. IRE, Vol.40(1952), 1098-1101
Efficient Seed Utilization for Reseeding based Compression - Erik Volkerink Subhasish (2003) (2 citations) (Correct)
No context found.
D.A. Huffman, "A Method for the Construction of Minimum Redundancy Codes", Proc. of IRE, Vol.40, No.9, pp. 1098-1101, 1952.
On the Analysis of Variable-to-Variable Length Codes - Serap Savari Bell (Correct)
No context found.
D. A. Huffman, "A method for the construction of minimum-redundancy codes," Proc. I.R.E. 40, 1098-1101, 1952.
Transient Errors and Rollback Recovery in LZ Compression - Wei-Je Huang And (2000) (Correct)
No context found.
Huffman, D. A., "A Method for the Construction of Minimum Redundancy Codes," Proc. IRE, Vol. 40, pp. 1098-1102, 1952.
On the Analysis of Variable-to-Variable Length Codes - Serap Savari Bell (Correct)
No context found.
D. A. Huffman, "A method for the construction of minimum-redundancy codes," Proc. I.R.E. 40, 1098-1101, 1952.
Theoretical Foundations of Transform Coding - Goyal (2001) (6 citations) (Correct)
No context found.
D.A. Huffman, "A method for the construction of minimum redundancy codes," Proc. IRE, vol. 40, pp.1098-1101, Sept. 1952.
Fractal Image Compression Based on Intrablock - Variance Distribution And (Correct)
No context found.
D. A. Huffman, "A method for the construction of minimum redundancy codes," Proc. IRE 40, 1098 --1101 #1952#.
Progress in Wavelet Algorithms and Applications - Mladen Victor Wickerhauser (Correct)
No context found.
D. A. Huffman, "A method for the construction of minimum-redundancy codes," Proceedings of the IRE 40, pp. 1098-1101, 1952.
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC