19 search results - page 4 / 4 » List Decoding for Binary Goppa Codes |
CORR
2007
Springer
13 years 5 months ago
2007
Springer
The analysis of random coding error exponents pertaining to erasure/list decoding, due to Forney, is revisited. Instead of using Jensen’s inequality as well as some other inequa...
IJNSEC
2007
13 years 5 months ago
2007
McEliece is one of the oldest known public key cryptosystems, however it was not quite as successful as RSA. One main reason is that it is widely believed that code-based cryptosy...
STOC
2006
ACM
14 years 5 months ago
2006
ACM
For every 0 < R < 1 and > 0, we present an explicit construction of error-correcting codes of rate R that can be list decoded in polynomial time up to a fraction (1 - R ...
TIT
2010
13 years 7 days ago
2010
We prove that binary linear concatenated codes with an outer algebraic code (specifically, a folded Reed-Solomon code) and independently and randomly chosen linear inner codes ach...