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
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.
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.
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