Minimum Distance of Binary or Ternary Linear Codes

This program tries to compute the minimum distance of linear codes over GF(2) and GF(3) or count the number of codewords in special cases. I'm quite confident that this is one of the fastest programs available. The processing time is limited. If the minimum distance of your code still can not be determined, send me the generator matrix and I will try to solve the problem with a parallel version of the program.

Please, put in some generator matrix in one of the following forms.

Example: The quadratic residue code C(11,6) over GF(3): n=11, k=6, p=3.
2 2 1 2 0 1 0 0 0 0 0
0 2 2 1 2 0 1 0 0 0 0
0 0 2 2 1 2 0 1 0 0 0
0 0 0 2 2 1 2 0 1 0 0
0 0 0 0 2 2 1 2 0 1 0
0 0 0 0 0 2 2 1 2 0 1

22120100000
02212010000
00221201000
00022120100
00002212010
00000221201


n:
k:
p: 2 3
Input of generator matrix:
  
w:
(Only if n=2k and to disjoint information sets of rank k)


Alfred.Wassermann@uni-bayreuth.de