77 search results - page 6 / 16 » Near-MDS codes over some small fields |
CORR
2010
Springer
13 years 8 months ago
2010
Springer
Abstract--We investigate the problem of maintaining an encoded distributed storage system when some nodes contain adversarial errors. Using the error-correction capabilities that a...
SODA
2008
ACM
13 years 10 months ago
2008
ACM
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...
TIT
2010
13 years 3 months ago
2010
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...
FOCS
2010
IEEE
13 years 6 months ago
2010
IEEE
Abstract. We present a Fourier-analytic approach to list-decoding Reed-Muller codes over arbitrary finite fields. We use this to show that quadratic forms over any field are locall...
BMCBI
2002
13 years 8 months ago
2002
Background: Pattern matching is the core of bioinformatics; it is used in database searching, restriction enzyme mapping, and finding open reading frames. It is done repeatedly ov...