Sciweavers

555 search results - page 43 / 111
» Polar codes are optimal for lossy source coding
Sort
View
TIT
2010
61views Education» more  TIT 2010»
13 years 3 months ago
Tunstall code, Khodak variations, and random walks
A variable-to-fixed length encoder partitions the source string into variable-length phrases that belong to a given and fixed dictionary. Tunstall, and independently Khodak, desig...
Michael Drmota, Yuriy A. Reznik, Wojciech Szpankow...
ICIP
1997
IEEE
14 years 10 months ago
Minimum-Entropy Clustering and its Application to Lossless Image Coding
The Minimum-Entropy Clustering (MEC) algorithm proposed in this paper provides an optimal method for addressing the non-stationarity of a source with respect to entropy coding. Th...
Farshid Golchin, Kuldip K. Paliwal
TIT
2008
83views more  TIT 2008»
13 years 8 months ago
The Information Lost in Erasures
Abstract--We consider sources and channels with memory observed through erasure channels. In particular, we examine the impact of sporadic erasures on the fundamental limits of los...
Sergio Verdú, Tsachy Weissman
IPPS
2007
IEEE
14 years 3 months ago
Multi-Core Model Checking with SPIN
—We present the first experimental results on the implementation of a multi-core model checking algorithm for the SPIN model checker. These algorithms specifically target shared-...
Gerard J. Holzmann, Dragan Bosnacki
TIT
2008
102views more  TIT 2008»
13 years 8 months ago
On Low-Complexity Maximum-Likelihood Decoding of Convolutional Codes
Abstract--This letter considers the average complexity of maximum-likelihood (ML) decoding of convolutional codes. ML decoding can be modeled as finding the most probable path take...
Jie Luo