Sciweavers

27 search results - page 1 / 6
» Local list-decoding and testing of random linear codes from ...
Sort
View
COCOON
2009
Springer
13 years 11 months ago
Limits to List Decoding Random Codes
It has been known since [Zyablov and Pinsker 1982] that a random q-ary code of rate 1 − Hq(ρ) − ε (where 0 < ρ < 1 − 1/q, ε > 0 and Hq(·) is the q-ary entropy ...
Atri Rudra
TIT
2010
136views Education» more  TIT 2010»
12 years 11 months ago
The existence of concatenated codes list-decodable up to the hamming bound
We prove that binary linear concatenated codes with an outer algebraic code (specifically, a folded Reed-Solomon code) and independently and randomly chosen linear inner codes ach...
Venkatesan Guruswami, Atri Rudra
PROPERTYTESTING
2010
13 years 2 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