184 search results - page 21 / 37 » Query Complexity Lower Bounds for Reconstruction of Codes |
131
click to vote
ALT
2010
Springer
15 years 20 days ago
2010
Springer
This paper is concerned with the combinatorial structure of concept classes that can be learned from a small number of examples. We show that the recently introduced notion of recu...
87
Voted
ALGORITHMICA
2002
15 years 10 days ago
2002
We describe a quantum black-box network computing the majority of N bits with zerosided error using only 2 3 N + O( N log( -1 log N)) queries: the algorithm returns the correct an...
116
Voted
EUROCRYPT
2012
Springer
13 years 2 months ago
2012
Springer
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...
88
Voted
ICALP
2005
Springer
15 years 6 months ago
2005
Springer
We consider the problem of testing the commutativity of a black-box group specified by its k generators. The complexity (in terms of k) of this problem was first considered by Pa...
68
Voted
TIT
1998
15 years 3 days ago
1998
— In this correspondence, the trellis representation of the Kerdock and Delsarte–Goethals codes is addressed. It is shown that the states of a trellis representation of DG(m; ...