Department of Mathematics
 Search | Help | Login | pdf version | printable version

Math @ Duke





.......................

.......................


Publications [#336910] of Vahid Tarokh

Papers Published

  1. Linder, T; Tarokh, V; Zeger, K, Existence of optimal prefix codes for infinite source alphabets, Ieee Transactions on Information Theory, vol. 43 no. 6 (December, 1997), pp. 2026-2028, Institute of Electrical and Electronics Engineers (IEEE) [doi]
    (last updated on 2023/06/01)

    Abstract:
    It is proven that for every random variable with a countably infinite set of outcomes and finite entropy there exists an optimal prefix code which can be constructed from Huffman codes for truncated versions of the random variable, and that the average lengths of any sequence of Huffman codes for the truncated versions converge to that of the optimal code. Also, it is shown that every optimal infinite code achieves Kraft's inequality with equality. © 1997 IEEE.

 

dept@math.duke.edu
ph: 919.660.2800
fax: 919.660.2821

Mathematics Department
Duke University, Box 90320
Durham, NC 27708-0320