19 search results - page 1 / 4 » Polynomial-Time Construction of Spherical Codes |
69
Voted
AAECC
1991
Springer
15 years 4 months ago
1991
Springer
113
Voted
STOC
2002
ACM
16 years 1 months ago
2002
ACM
We study the average-case hardness of the class NP against deterministic polynomial time algorithms. We prove that there exists some constant ? > 0 such that if there is some l...
112
Voted
CATS
2006
15 years 2 months ago
2006
A complete description and proof of correctness are given for a new polynomial time algorithm for a class of codes based on directed graphs and involving construction well known i...
118
Voted
GLOBECOM
2010
IEEE
14 years 11 months ago
2010
IEEE
Streaming erasure codes encode a source stream to guarantee that each source packet is recovered within a fixed delay at the receiver over a burst-erasure channel. This paper intro...
111
Voted
TIT
2008
15 years 1 months ago
2008
We present error-correcting codes that achieve the information-theoretically best possible trade-off between the rate and error-correction radius. Specifically, for every 0 < R...