132 search results - page 13 / 27 » On correctable errors of binary linear codes |
SACRYPT
2009
Springer
14 years 3 months ago
2009
Springer
The classical McEliece cryptosystem is built upon the class of Goppa codes, which remains secure to this date in contrast to many other families of codes but leads to very large pu...
FOCS
1999
IEEE
14 years 26 days ago
1999
IEEE
We show that the minimum distance of a linear code is not approximable to within any constant factor in random polynomial time (RP), unless nondeterministic polynomial time (NP) eq...
CORR
2007
Springer
13 years 8 months ago
2007
Springer
Abstract—We initiate the probabilistic analysis of linear programming (LP) decoding of low-density parity-check (LDPC) codes. Specifically, we show that for a random LDPC code e...
ICASSP
2008
IEEE
14 years 3 months ago
2008
IEEE
In this paper, a new approach for decoding real-field codes based on finding sparse solutions of underdetermined linear systems is proposed. This algorithm iteratively estimates...
ICIAP
2009
ACM
14 years 9 months ago
2009
ACM
Multi-class binary symbol classification requires the use of rich descriptors and robust classifiers. Shape representation is a difficult task because of several symbol distortions...