We have number of non-isomorphic graphs given in http://planetmath.org/enumeratinggraphsOver an alphabet $q$ how many non-isomorphic $[n,k,d]_q$ codes are possible particularly in the special case of $d=n-k+1$ (MDS case)?The paper here provides number of non-isomorphic $[n,k]_2$ codes without restricting distance.My question has distance restriction.
Number of non-isomorphic codes
coding theory;graph isomorphism