52 search results - page 4 / 11 » Performance of universal codes over infinite alphabets |
TWC
2010
13 years 13 days ago
2010
In this letter the performance limits and design principles of rateless codes over fading channels are studied. The diversity-multiplexing tradeoff (DMT) is used to analyze the sys...
ICIP
2005
IEEE
14 years 7 months ago
2005
IEEE
In this paper we present a new method for image coding that is able to achieve good results over a wide range of image types. This work is based on the Multidimensional Multiscale...
CORR
2010
Springer
13 years 3 months ago
2010
Springer
A unified framework to obtain all known lower bounds (random coding, typical random coding and expurgated bound) on the reliability function of a point-to-point discrete memoryles...
ICS
1997
Tsinghua U.
13 years 10 months ago
1997
Tsinghua U.
Modern microprocessors can achieve high performance on linear algebra kernels but this currently requires extensive machine-speci c hand tuning. We have developed a methodology wh...
SIAMDM
2008
13 years 5 months ago
2008
Let C be a code of length n over an alphabet of size q. A word d is a descendant of a pair of codewords x, y C if di {xi, yi} for 1 i n. A code C is an identifiable parent prop...