The linear programming bound for binary linear codes

Combining Delsarte's (1973) linear programming bound with the information that certain weights cannot occur, new upper bounds for d/sub min/ (n,k), the maximum possible minimum distance of a binary linear code with given word length n and dimension k, are derived.< >

Saved in:
Bibliographic Details
Published inIEEE transactions on information theory Vol. 39; no. 2; pp. 677 - 680
Main Author Brouwer, A.E.
Format Journal Article
LanguageEnglish
Published New York, NY IEEE 01.03.1993
Institute of Electrical and Electronics Engineers
Subjects
Applied sciences
Coding, codes
Computer science
Exact sciences and technology
Information, signal and communications theory
Linear code
Linear programming
Mathematics
Signal and communications theory
Table lookup
Telecommunications and information theory
Upper bound
Vectors
Linear code
Upper bound
Coding
Word length
Linear programming
Minimal distance
Binary code
Online AccessGet full text

Cover

More Information
Summary:Combining Delsarte's (1973) linear programming bound with the information that certain weights cannot occur, new upper bounds for d/sub min/ (n,k), the maximum possible minimum distance of a binary linear code with given word length n and dimension k, are derived.< >
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0018-9448
1557-9654
DOI:10.1109/18.212302