199 search results - page 24 / 40 » Linear time encodable and list decodable codes |
CC
2008
Springer
13 years 7 months ago
2008
Springer
We prove a version of the derandomized Direct Product lemma for deterministic space-bounded algorithms. Suppose a Boolean function g : {0, 1}n {0, 1} cannot be computed on more th...
ICC
2009
IEEE
14 years 2 months ago
2009
IEEE
Abstract—We consider non-asymmetric distributed source coding (DSC) that achieves any point in the Slepian-Wolf (SW) region. We study the error propagation phenomena and propose ...
STOC
2001
ACM
14 years 7 months ago
2001
ACM
We study error-correcting codes for highly noisy channels. For example, every received signal in the channel may originate from some half of the symbols in the alphabet. Our main c...
CISS
2008
IEEE
14 years 1 months ago
2008
IEEE
— We propose an implementable new universal lossy source coding algorithm. The new algorithm utilizes two wellknown tools from statistical physics and computer science: Gibbs sam...
GLOBECOM
2006
IEEE
14 years 1 months ago
2006
IEEE
— Enhanced Data Rates for Global Evolution (EDGE) based systems are expected to facilitate the same services as third generation WCDMA systems. This goal is achieved through phys...