New results on optimal error-correcting codes
Patric R. J. Östergård · 2003
Let A/sub q/(n,d) denote the maximum cardinality of a q-ary code with length n and minimum distance d. An approach for classifying such error-correcting codes-and thereby obtaining values of A/sub q/(n, d)-is presented. Using this approach, which is based on backtrack search and isomorphism rejection, several open cases have been settled, including A/sub 2/(10,3)=A/sub 2/(11,4)=72, A/sub 2/(11,3)=A/sub 2/(12,4)=144, A/sub 3/(6,3)=38, A/sub 3/(7,4)=33, and A/sub 3/(8,4)=99.