The hardness of decoding linear codes with preprocessing
- 1 March 1990
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 36 (2) , 381-385
- https://doi.org/10.1109/18.52484
Abstract
No abstract availableThis publication has 12 references indexed in Scilit:
- Neural networks, error-correcting codes, and polynomials over the binary n-cubeIEEE Transactions on Information Theory, 1989
- A new approach to the general minimum distance decoding problem: The zero-neighbors algorithmIEEE Transactions on Information Theory, 1985
- Separating the polynomial-time hierarchy by oraclesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1985
- Parity, circuits, and the polynomial-time hierarchyTheory of Computing Systems, 1984
- AlternationJournal of the ACM, 1981
- Some connections between nonuniform and uniform complexity classesPublished by Association for Computing Machinery (ACM) ,1980
- A second step toward the polynomial hierarchyTheoretical Computer Science, 1979
- On the inherent intractability of certain coding problems (Corresp.)IEEE Transactions on Information Theory, 1978
- The polynomial-time hierarchyTheoretical Computer Science, 1976
- The equivalence problem for regular expressions with squaring requires exponential spacePublished by Institute of Electrical and Electronics Engineers (IEEE) ,1972