The Hardness of Solving Subset Sum with Preprocessing

IEEE Transactions on Information Theory

Volumn 36, Issue 4, 1990, Pages 943-946

  Lobstein, Antoine ^a  

^a TELECOM PARISTECH   (France)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY--COMPUTABILITY AND DECIDABILITY; COMPUTER METATHEORY--COMPUTATIONAL COMPLEXITY;

LINEAR DECODING; POLYNOMIAL TIME; SUBSET SUM;

CODES, SYMBOLIC;

EID: 0025460808     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/18.53763     Document Type: Article

References (7)

1. E. R. Berlekamp, R. J. McEliece, and H. C. A. van Tilborg, “On the inherent intractability of certain coding problems,” IEEE Trans. Inform. Theory, vol. IT-24, no. 3, pp. 384–386, May 1978.
2. J. Bruck and M. Naor, “The hardness of decoding linear codes with preprocessing,” IEEE Tram. Inform. Theory, vol. 36, no. 2, pp. 381–385, Mar. 1990.
3. M. R. Garey and D. S. Johnson, Computers and Intractability, A Guide to the Theory of NP-Completeness. New York: Freeman, 1979.
4. R. M. Karp and R. J. Lipton, “Some connections between nonuniform and uniform complexity classes,” Proc. 12th ACM Symp. Theory of Computing, 1980, pp. 302–309.
5. A. Lobstein, “A new proof for the complexity of linear decoding with preprocessing,” ENST tech, report, Paris, 1989.
6. R. J. McEliece, “A public-key cryptosystem based on algebraic coding theory,” JPL DSN Progress Report 42–44, pp. 114–116, Feb. 1978.
7. R. C. Merkle and M. E. Heilman, “Hiding information and signatures in trapdoor knapsacks,” IEEE Trans. Inform. Theory, vol. IT-24, no. 5, pp. 525–530, Sept. 1978.