18 search results - page 3 / 4 » Sparse Random Linear Codes are Locally Decodable and Testabl... |
COCO
2011
Springer
12 years 5 months ago
2011
Springer
Let f ∈ Fq[x] be a polynomial of degree d ≤ q/2. It is well-known that f can be uniquely recovered from its values at some 2d points even after some small fraction of the valu...
ICC
2008
IEEE
14 years 7 days ago
2008
IEEE
—Wireless sensor networks consist of unreliable and energy-constrained sensors connecting to each other wirelessly. As measured data may be lost due to sensor failures, maintaini...
STOC
1998
ACM
13 years 10 months ago
1998
ACM
In [6], Gallager introduces a family of codes based on sparse bipartite graphs, which he calls low-density parity-check codes. He suggests a natural decoding algorithm for these c...
ICIW
2009
IEEE
14 years 13 days ago
2009
IEEE
BitTorrent and Practical Network Coding are efficient methods for sharing files in a peer-to-peer network. Both face the problem to distribute a given file using peers with dif...
STOC
2004
ACM
14 years 6 months ago
2004
ACM
The main result of this paper is a near-optimal derandomization of the affine homomorphism test of Blum, Luby and Rubinfeld (Journal of Computer and System Sciences, 1993). We sho...