3 search results - page 1 / 1 » Optimal Prefix Codes for Infinite Alphabets With Nonlinear C... |
TIT
2008
13 years 4 months ago
2008
Let P = {p(i)} be a measure of strictly positive probabilities on the set of nonnegative integers. Although the countable number of inputs prevents usage of the Huffman algorithm, ...
DCC
2006
IEEE
13 years 8 months ago
2006
IEEE
Abstract. We address the problem of designing optimal prefix-free codes over an encoding alphabet with unequal integer letter costs. The most efficient algorithm proposed so far ha...
CORR
2011
Springer
12 years 11 months ago
2011
Springer
—In this paper we consider an interacting two-agent sequential decision-making problem consisting of a Markov source process, a causal encoder with feedback, and a causal decoder...