Sciweavers

1184 search results - page 5 / 237
» Algorithmic Results in List Decoding
Sort
View
76
Voted
SODA
2010
ACM
169views Algorithms» more  SODA 2010»
15 years 9 months ago
Efficiently Decodable Non-adaptive Group Testing
We consider the following "efficiently decodable" nonadaptive group testing problem. There is an unknown string x {0, 1}n with at most d ones in it. We are allowed to t...
Piotr Indyk, Hung Q. Ngo, Atri Rudra
ESA
2000
Springer
84views Algorithms» more  ESA 2000»
15 years 3 months ago
On Representations of Algebraic-Geometric Codes for List Decoding
Abstract. We show that all algebraic-geometric codes possess a succinct representation that allows for the list decoding algorithms of [15, 7] to run in polynomial time. We do this...
Venkatesan Guruswami, Madhu Sudan
AAECC
2007
Springer
113views Algorithms» more  AAECC 2007»
15 years 5 months ago
Generalized Sudan's List Decoding for Order Domain Codes
Abstract. We generalize Sudan’s list decoding algorithm without multiplicity to evaluation codes coming from arbitrary order domains. The number of correctable errors by the prop...
Olav Geil, Ryutaroh Matsumoto
JSAC
2006
85views more  JSAC 2006»
14 years 11 months ago
Iterative algebraic soft-decision list decoding of Reed-Solomon codes
In this paper, we present an iterative soft-decision decoding algorithm for Reed
Mostafa El-Khamy, Robert J. McEliece
STOC
2004
ACM
134views Algorithms» more  STOC 2004»
15 years 12 months ago
Better extractors for better codes?
We present an explicit construction of codes that can be list decoded from a fraction (1 - ) of errors in sub-exponential time and which have rate / logO(1) (1/). This comes close...
Venkatesan Guruswami