54 search results - page 10 / 11 » Upper Bound on List-Decoding Radius of Binary Codes |
TIT
2008
15 years 3 days ago
2008
In this paper, redundant random ensembles are defined and their average stopping set (SS) weight distributions are analyzed. A redundant random ensemble consists of a set of binar...
86
Voted
IANDC
2007
15 years 5 days ago
2007
In many cases, the addition of metric operators to qualitative temporal logics (TLs) increases the complexity of satisfiability by at least one exponential: while common qualitat...
91
Voted
STACS
2004
Springer
15 years 5 months ago
2004
Springer
We present two simple algorithms for SAT and prove upper bounds on their running time. Given a Boolean formula F in conjunctive normal form, the first algorithm finds a satisfyin...
102
click to vote
CORR
2007
Springer
15 years 6 days ago
2007
Springer
—The Grassmann manifold Gn,p (L) is the set of all p-dimensional planes (through the origin) in the n-dimensional Euclidean space Ln , where L is either R or C. This paper consid...
118
click to vote
CRYPTO
2011
Springer
14 years 1 days ago
2011
Springer
Very few public-key cryptosystems are known that can encrypt and decrypt in time b2+o(1) with conjectured security level 2b against conventional computers and quantum computers. Th...