q = 2 , 3 , 4 , 5 , 7 , 8 , 9

We give tables of generator matrices of
linear (n,k)-codes over the finite field with q elements. For given
length and dimension the entry in the table contains two bounds d1 and
d2 on the minimum distance:

q=? |
... |
k=j |
... |

... |
|||

n=i |
d1-d2 |
||

... |

- d1 means that we constructed an
(i,j)-code with minimum distance
d1 using the method described in "Optimal
linear codes from projective groups" (Michael Braun, Axel Kohnert and
Alfred Wassermann, in preparation). d1 contains a link to a
generator matrix of such a code.

- d2 is the upper bound for an (i,j)-code (see Brouwer's table
)

How to read the colors in the table

d1 |

d1-d2 |

d1-d2 |

d1-d2 |