The linear programming bound for binary linear codes

Research output: Contribution to journalArticleAcademicpeer-review

16 Citations (Scopus)
4 Downloads (Pure)

Abstract

Combining Delsarte's (1973) linear programming bound with the information that certain weights cannot occur, new upper bounds for dmin (n,k), the maximum possible minimum distance of a binary linear code with given word length n and dimension k, are derived.
Original languageEnglish
Pages (from-to)677-680
JournalIEEE Transactions on Information Theory
Volume39
Issue number2
DOIs
Publication statusPublished - 1993

Fingerprint Dive into the research topics of 'The linear programming bound for binary linear codes'. Together they form a unique fingerprint.

Cite this