Upper bounds for A(n,4) and A(n,6) derived from Delsarte's linear programming bound

DOI10.1016/0012-365X(82)90126-1zbMath0491.94020MaRDI QIDQ1167704

Cornelis Roos, Cornelis De Vroedt

Publication date: 1982

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

minimum distancebinary codedistance distribution

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Cites Work

• The triply shortened binary Hamming code is optimal
• New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities
• Bounds for binary codes of length less than 25
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Upper bounds for A(n,4) and A(n,6) derived from Delsarte's linear programming bound