Optimal binary linear codes of length \(\leq 30\)

DOI10.1016/S0012-365X(99)00135-1zbMath0976.94031MaRDI QIDQ1587601

David B. Jaffe

Publication date: 13 January 2002

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

zbMATH Keywords

binary linear codeminimum distancedistance-optimal code

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Linear codes and caps in Galois spaces (51E22)

Related Items (13)

The Program Generation in the Software Package QextNewEdition ⋮ Two-level screening designs derived from binary nonlinear codes ⋮ Minimal binary linear codes: a general framework based on bent concatenation ⋮ Optimal subcodes of formally self-dual codes and their optimum distance profiles ⋮ On the minimum weights of binary linear complementary dual codes ⋮ Optimal binary linear complementary pairs of codes ⋮ Optimal subcodes and optimum distance profiles of self-dual codes ⋮ What is known about unit cubes ⋮ On the classification of extremal even formally self-dual codes of lengths 20 and 22 ⋮ On the classification and enumeration of self-dual codes ⋮ Randomized generation of error control codes with automata and transducers ⋮ Binary optimal linear rate 1/2 codes ⋮ Binary isodual codes having an automorphism of odd prime order

This page was built for publication: Optimal binary linear codes of length \(\leq 30\)