82 search results - page 6 / 17 » Randomized Decoding for Selection-and-Ordering Problems |
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
Random binary matrices have found many applications in signal processing and coding. Rateless codes, for example, are based on the random generation of codewords by means of inner...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
In this paper we study the spectrum of certain large random Hermitian Jacobi matrices. These matrices are known to describe certain communication setups. In particular we are inte...
STOC
2004
ACM
14 years 8 months ago
2004
ACM
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...
STOC
2000
ACM
14 years 6 days ago
2000
ACM
We describe a slightly subexponential time algorithm for learning parity functions in the presence of random classification noise, a problem closely related to several cryptograph...
FOCS
2000
IEEE
14 years 8 days ago
2000
IEEE
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...