NASA Logo

NTRS

NTRS - NASA Technical Reports Server

Collections About News Help Login
Back to Results
On the inherent intractability of finding good codesThe problem of computing the minimum distance of an arbitrary binary linear code is non-polynomial complete. This strongly suggests, but does not imply, that it is impossible to design a computer algorithm for computing the minimum distance of an arbitrary code whose running time is bounded by a polynomial in the number of inputs.
Document ID
19770012159
Acquisition Source
Legacy CDMS
Document Type
Other
Authors
Mceliece, R. J. (Jet Propulsion Lab., California Inst. of Tech. Pasadena, CA, United States)
Vantilborg, H. C. A. (Jet Propulsion Lab., California Inst. of Tech. Pasadena, CA, United States)
Date Acquired
August 8, 2013
Publication Date
February 15, 1977
Publication Information
Publication: The Deep Space Network
Subject Category
Computer Programming And Software
Accession Number
77N19103
Distribution Limits
Public
Copyright
Work of the US Gov. Public Use Permitted.

Available Downloads

There are no available downloads for this record.

Related Records

IDRelationTitle19770012147Collected WorksThe deep space network
No Preview Available