NASA Logo

NTRS

NTRS - NASA Technical Reports Server

Collections About News Help Login
Back to Results
On the existence of binary simplex codesUsing a simple combinatorial construction, the existence of a binary simplex code with m codewords for all m is greater than or equal to 1 is proved. The problem of the shortest possible length is left open.
Document ID
19780007131
Acquisition Source
Legacy CDMS
Document Type
Reprint (Version printed in journal)
Authors
Taylor, H. (Jet Propulsion Lab., California Inst. of Tech. Pasadena, CA, United States)
Date Acquired
August 9, 2013
Publication Date
June 15, 1977
Publication Information
Publication: The Deep Space Network, Vol. 39
Subject Category
Numerical Analysis
Accession Number
78N15074
Distribution Limits
Public
Copyright
Work of the US Gov. Public Use Permitted.

Available Downloads

There are no available downloads for this record.

Related Records

IDRelationTitle19780007124Collected WorksThe Deep Space Network, volume 39
No Preview Available