-
1
-
-
38149146617
-
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
-
3
-
-
0004015324
-
-
Prentice Hall, Englewood Cliffs, NJ
-
T. C. Bell, J.G. Cleary and I.H. Witten, Text Compression, Prentice Hall, Englewood Cliffs, NJ, 1990.
-
(1990)
Text Compression
-
-
Bell, T.C.1
Cleary, J.G.2
Witten, I.H.3
-
5
-
-
0016485796
-
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
-
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
-
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
-
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
-
9
-
-
0030151204
-
Huffman Coding With Infinite Alphabet
-
A. Kato, T.S. Han, H. Nagaoka, Huffman Coding With Infinite Alphabet, IEEE Trans. Inform. Theory, 42(1996)5, 977-984.
-
(1996)
IEEE Trans. Inform. Theory
, vol.42
, Issue.5
, pp. 977-984
-
-
Kato, A.1
Han, T.S.2
Nagaoka, H.3
-
10
-
-
0031271475
-
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
-
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
-
13
-
-
0030150167
-
On Break a Huffman Code
-
David W. Gillman, mojdeh Mohtashemi, and Ronald L. Rivest, On Break a Huffman Code, IEEE Trans. Inform. Theory, IT- 42(1996)3, 972-976.
-
(1996)
IEEE Trans. Inform. Theory
, vol.IT- 42
, Issue.3
, pp. 972-976
-
-
Gillman, D.W.1
Mohtashemi, M.2
Rivest, R.L.3
|