33 search results - page 1 / 7 » Alphabetic coding with exponential costs |
IPL
2010
13 years 6 months ago
2010
An alphabetic binary tree formulation applies to problems in which an outcome needs to be determined via alphabetically ordered search prior to the termination of some window of o...
TIT
2008
13 years 7 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, ...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
This paper deals with the problem of universal lossless coding on a countable infinite alphabet. It focuses on some classes of sources defined by an envelope condition on the margi...
IANDC
2008
13 years 7 months ago
2008
We investigate code trees and search trees with cost functions that increase exponentially with the depth in the tree. While corresponding coding theorems have been considered in ...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
An erasure channel with a fixed alphabet size q, where q 1, is studied . It is proved that over any erasure channel (with or without memory), Maximum Distance Separable (MDS) codes...