19 search results - page 2 / 4 » Polynomial-Time Construction of Spherical Codes |
ACISP
2007
Springer
14 years 1 months ago
2007
Springer
This paper improves the Finiasz-Vaudenay construction of TCHo, a hardware-oriented public-key cryptosystem, whose security relies on the hardness of finding a low-weight multiple ...
APPROX
2007
Springer
14 years 1 months ago
2007
Springer
We give a polynomial time construction of binary codes with the best currently known trade-off between rate and error-correction radius. Specifically, we obtain linear codes ove...
APPROX
2011
Springer
12 years 7 months ago
2011
Springer
This work considers locally decodable codes in the computationally bounded channel model. The computationally bounded channel model, introduced by Lipton in 1994, views the channe...
CORR
2008
Springer
13 years 6 months ago
2008
Springer
Abstract. The complexity of maximum likelihood decoding of the ReedSolomon codes [q -1, k]q is a well known open problem. The only known result [4] in this direction states that it...
TIT
1998
13 years 7 months ago
1998
—In 1948 Shannon developed fundamental limits on the efficiency of communication over noisy channels. The coding theorem asserts that there are block codes with code rates arbit...