The linear programming bound for binary linear codes

From MaRDI portal

Revision as of 13:34, 6 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4202097

Jump to:navigation, search

DOI10.1109/18.212302zbMath0776.94018OpenAlexW2146717030MaRDI QIDQ4202097

Andries E. Brouwer

Publication date: 16 September 1993

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/18.212302

zbMATH Keywords

binary linear code Delsarte's linear programming bound

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Bounds on codes (94B65)

Related Items (6)

Nonexistence of near-extremal formally self-dual even codes of length divisible by 8 ⋮ A note on formally self-dual even codes of length divisible by 8 ⋮ The degree of functions and weights in linear codes. ⋮ A sharpening of the Johnson bound for binary linear codes and the nonexistence of linear codes with Preparata parameters ⋮ Fundamentals of coding type problems ⋮ Unnamed Item

This page was built for publication: The linear programming bound for binary linear codes

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4202097&oldid=18053657"