33 search results - page 2 / 7 » Alphabetic coding with exponential costs |
DCC
2006
IEEE
13 years 11 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...
VTC
2007
IEEE
14 years 1 months ago
2007
IEEE
Abstract— This paper presents a methodology for determining the capacity of coherently detected continuousphase frequency shift keying (CPFSK) modulation under the constraints of...
CORR
2011
Springer
13 years 2 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...
TIT
2008
13 years 7 months ago
2008
The minimum distance is one of the most important combinatorial characterizations of a code. The maximum likelihood decoding problem is one of the most important algorithmic proble...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
— This work considers the problem of transmitting multiple compressible sources over a network with minimum cost. The problem is complicated by the fact that the description of t...