Sciweavers

160 search results - page 4 / 32
» On the List-Decodability of Random Linear Codes
Sort
View
EUROCRYPT
2012
Springer
11 years 10 months ago
Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding
Decoding random linear codes is a well studied problem with many applications in complexity theory and cryptography. The security of almost all coding and LPN/LWE-based schemes rel...
Anja Becker, Antoine Joux, Alexander May, Alexande...
TSP
2012
12 years 3 months ago
Randomized Isometric Linear-Dispersion Space-Time Block Coding for the DF Relay Channel
This article presents a randomized linear-dispersion space-time block code for decode-andforward synchronous relays. The coding matrices are obtained as a set of columns (or rows)...
David Gregoratti, Walid Hachem, Xavier Mestre
PROPERTYTESTING
2010
13 years 5 months ago
Some Recent Results on Local Testing of Sparse Linear Codes
We study the local testability of linear codes. We first reformulate this question in the language of tolerant linearity testing under a non-uniform distribution. We then study th...
Swastik Kopparty, Shubhangi Saraf
FOCS
2000
IEEE
14 years 3 days ago
Extracting Randomness from Samplable Distributions
Randomness extractors convert weak sources of randomness into an almost uniform distribution; the conversion uses a small amount of pure randomness. In algorithmic applications, t...
Luca Trevisan, Salil P. Vadhan
STOC
2001
ACM
163views Algorithms» more  STOC 2001»
14 years 8 months ago
Extractor codes
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...
Amnon Ta-Shma, David Zuckerman