메뉴 건너뛰기




Volumn 2, Issue , 2005, Pages 475-479

A memory-efficient Huffman decoding algorithm

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CODES (SYMBOLS); DATA STORAGE EQUIPMENT; DATA STRUCTURES; PERFORMANCE; TREES (MATHEMATICS);

EID: 33744455504     PISSN: 1550445X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/AINA.2005.33     Document Type: Conference Paper
Times cited : (11)

References (7)
  • 3
    • 84938015047 scopus 로고
    • A method for the construction of minimum redundancy codes
    • D.A. Huffman, "A method for the construction of minimum redundancy codes," In Proc. IRE 40 (1952), pp. 1098-1101.
    • (1952) Proc. IRE , vol.40 , pp. 1098-1101
    • Huffman, D.A.1
  • 5
    • 0029394311 scopus 로고
    • Memory efficient and high-speed search Huffman coding
    • R. Hashemian, "Memory efficient and high-speed search Huffman coding," IEEE Trans. Commun. 43 (1995), pp. 2576-2581.
    • (1995) IEEE Trans. Commun. , vol.43 , pp. 2576-2581
    • Hashemian, R.1
  • 6
    • 0007758265 scopus 로고    scopus 로고
    • Efficient Huffman decoding
    • K.L. Chung, "Efficient Huffman decoding," Inform. Process. Lett. 61 (1997), pp. 97-99.
    • (1997) Inform. Process. Lett. , vol.61 , pp. 97-99
    • Chung, K.L.1
  • 7
    • 0033075594 scopus 로고    scopus 로고
    • A memoryefficient and fast Huffman decoding algorithm
    • H.C. Chen, Y.L. Wang and Y.F. Lan, "A memoryefficient and fast Huffman decoding algorithm," Inform. Process. Lett. 69 (1999), pp. 119-122.
    • (1999) Inform. Process. Lett. , vol.69 , pp. 119-122
    • Chen, H.C.1    Wang, Y.L.2    Lan, Y.F.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.