160 search results - page 15 / 32 » On the List-Decodability of Random Linear Codes |
APPROX
2008
Springer
13 years 9 months ago
2008
Springer
A (q, , )-locally decodable code (LDC) C : {0, 1}n {0, 1}m is an encoding from n-bit strings to m-bit strings such that each bit xk can be recovered with probability at least 1 2 +...
ICCCN
2007
IEEE
14 years 2 months ago
2007
IEEE
—This paper focuses on the use of specific interleaving techniques for use in W-CDMA (Wideband Code Division Multiple Access). The linear equalization algorithm usually performs ...
ICASSP
2010
IEEE
13 years 8 months ago
2010
IEEE
This paper presents a novel algorithm for computing the relative motion between images from compressed linear measurements. We propose a geometry based correlation model that desc...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
We provide a novel achievability proof of the Slepian-Wolf theorem for i.i.d. sources over finite alphabets. We demonstrate that random codes that are linear over the real field ac...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
Abstract—The capacity of multiuser networks has been a longstanding problem in information theory. Recently, Avestimehr et al. have proposed a deterministic network model to appr...