1060 search results - page 25 / 212 » Notes on Coding Theory |
CSL
2010
Springer
14 years 9 months ago
2010
Springer
We study probabilistic complexity classes and questions of derandomisation from a logical point of view. For each logic L we introduce a new logic BPL, bounded error probabilistic ...
TIT
2002
14 years 9 months ago
2002
-- We characterize the best achievable performance of lossy compression algorithms operating on arbitrary random sources, and with respect to general distortion measures. Direct an...
STOC
2009
ACM
15 years 10 months ago
2009
ACM
Linear programming decoding for low-density parity check codes (and related domains such as compressed sensing) has received increased attention over recent years because of its p...
CORR
2008
Springer
14 years 9 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...
TIT
2011
14 years 4 months ago
2011
— In this paper, we extend the notion of generalized Hamming weight for classical linear block code to linear network codes by introducing the network generalized Hamming weight ...