NASA Logo

NTRS

NTRS - NASA Technical Reports Server

Collections About News Help Login
Back to Results
On the inherent intractability of certain coding problemsThe fact that the general decoding problem for linear codes and the general problem of finding the weights of a linear code are both NP-complete is shown. This strongly suggests, but does not rigorously imply, that no algorithm for either of these problems which runs in polynomial time exists.
Document ID
19780054314
Acquisition Source
Legacy CDMS
Document Type
Reprint (Version printed in journal)
Authors
Berlekamp, E. R. (California, University Berkeley, Calif., United States)
Mceliece, R. J. (California Institute of Technology, Jet Propulsion Laboratory, Pasadena Calif., United States)
Van Tilborg, H. C. A. (Eindhoven Technische Hogeschool, Eindhoven, Netherlands)
Date Acquired
August 9, 2013
Publication Date
May 1, 1978
Publication Information
Publication: IEEE Transactions on Information Theory
Volume: IT-24
Subject Category
Cybernetics
Accession Number
78A38223
Funding Number(s)
CONTRACT_GRANT: NAS7-100
Distribution Limits
Public
Copyright
Other

Available Downloads

There are no available downloads for this record.

Related Records

There are no records associated with this record.
No Preview Available