Optimal binary linear codes of length /spl les/30

We classify optimal binary linear codes of length /spl les/30. This paper summarizes the results. To do this, we utilize the author's language Split. The body of this paper is a formal program in the Split language, which can be verified by execution. This paper builds on the work of numerous people, who have exhibited codes with particular parameters, or proved that they do not-exist.