82 search results - page 4 / 17 » Randomized Decoding for Selection-and-Ordering Problems |
102
click to vote
STOC
2005
ACM
15 years 10 months ago
2005
ACM
Our main result is a reduction from worst-case lattice problems such as GAPSVP and SIVP to a certain learning problem. This learning problem is a natural extension of the `learnin...
WEWORC
2007
14 years 10 months ago
2007
Abstract. Courtois, Finiasz and Sendrier proposed in 2001 a practical code-based signature scheme. We give a rigorous security analysis of a modified version of this scheme in the...
CORR
2007
Springer
14 years 9 months ago
2007
Springer
— The distributed source coding problem is considered when the sensors, or encoders, are under Byzantine attack; that is, an unknown number of sensors have been reprogrammed by a...
GECCO
2004
Springer
15 years 3 months ago
2004
Springer
Permutations of vertices can represent constrained spanning trees for evolutionary search via a decoder based on Prim’s algorithm, and random keys can represent permutations. Tho...
TIT
2008
14 years 9 months ago
2008
The minimum distance is one of the most important combinatorial characterizations of a code. The maximum likelihood decoding problem is one of the most important algorithmic proble...