We have number of non-isomorphic graphs given in http://planetmath.org/enumeratinggraphs

Over 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.

  • 1
    $\begingroup$ I would think that this question is much more likely to get an answer in MathOverflow. If it doesn't get an answer here in a few days, you should ask it there. $\endgroup$ – Peter Shor Nov 1 '13 at 11:25

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.