메뉴 건너뛰기




Volumn , Issue , 2001, Pages 493-497

Optimal maximal encoding different from Huffman encoding

Author keywords

[No Author keywords available]

Indexed keywords

ENCODING (SYMBOLS); OPTIMAL SYSTEMS; RANDOM VARIABLES;

EID: 84961817156     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ITCC.2001.918845     Document Type: Conference Paper
Times cited : (7)

References (14)
  • 1
    • 38149146617 scopus 로고
    • Huffman-type Codes for Infinite Source Distributions
    • J. Abrahams, Huffman-type Codes for Infinite Source Distributions, J. Franklin Inst., Vol.331B(1994)3, 265-271.
    • (1994) J. Franklin Inst. , vol.331 B , Issue.3 , pp. 265-271
    • Abrahams, J.1
  • 5
    • 0016485796 scopus 로고
    • Optimal Source Coding for Geometrically Distributed Integer Alphabets
    • R.A. Gallager and D.C. Van Voorhis, Optimal Source Coding for Geometrically Distributed Integer Alphabets, IEEE Trans. Inform. Theory, IT-21(1975)3, 228-230.
    • (1975) IEEE Trans. Inform. Theory , vol.IT-21 , Issue.3 , pp. 228-230
    • Gallager, R.A.1    Van Voorhis, D.C.2
  • 6
    • 84938015047 scopus 로고
    • A Method for the Construction of Minimum-Redundancy Codes
    • D.A. Huffman, A Method for the Construction of Minimum-Redundancy Codes, Proc. IRE, Vol.40 (1952), 1098-1101.
    • (1952) Proc. IRE , vol.40 , pp. 1098-1101
    • Huffman, D.A.1
  • 7
    • 0017906950 scopus 로고
    • Optimal Source Coding for a Class of Integer Alphabet
    • P.A. Humblet, Optimal Source Coding for a Class of Integer Alphabet, IEEE Trans. Inform. Theory, IT-24(1978)1, 110-112.
    • (1978) IEEE Trans. Inform. Theory , vol.IT-24 , Issue.1 , pp. 110-112
    • Humblet, P.A.1
  • 8
    • 0001568873 scopus 로고    scopus 로고
    • Codes
    • G. Rozenberg, A. Salomaa (editors), Springer-Verlag Berlin Heidelberg
    • H. Jürgensen, S. Konstantinidis, Codes, in: G. Rozenberg, A. Salomaa (editors), Handbook of Formal Languages, Vol.1, Springer-Verlag Berlin Heidelberg,1997, 511-607.
    • (1997) Handbook of Formal Languages , vol.1 , pp. 511-607
    • Jürgensen, H.1    Konstantinidis, S.2
  • 10
    • 0031271475 scopus 로고    scopus 로고
    • Existence of Optimal Prefix Codes for Infinite Source Alphabets
    • T. Linder, V. Tarokh, K. Zeger, Existence of Optimal Prefix Codes for Infinite Source Alphabets, IEEE Trans. Inform. Theory, 43(1997)6, 2026-2028.
    • (1997) IEEE Trans. Inform. Theory , vol.43 , Issue.6 , pp. 2026-2028
    • Linder, T.1    Tarokh, V.2    Zeger, K.3
  • 11
    • 0023250198 scopus 로고
    • On the Redundancy of Optimal Binary Prefix Condition Codes for Finite and Infinite Sources
    • B. Montgomery, J. Abrahams, On the Redundancy of Optimal Binary Prefix Condition Codes for Finite and Infinite Sources, IEEE Trans. Inform. Theory, IT-33(1987)1, 156-160.
    • (1987) IEEE Trans. Inform. Theory , vol.IT-33 , Issue.1 , pp. 156-160
    • Montgomery, B.1    Abrahams, J.2


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