Generator
matrices of distance optimal binary codes |

- either the biggest minimum distance d of a binary (n,k)-code, which is indicated as [d] in the k-th position for codes of length n
- or an interval [d
_{1},d_{2}], when we present a generator matrix of an (n,k)-code with minimum distance d_{1}and when it is not possible to exclude the existence of (n,k)-codes of length d_{1}+1,...,d_{2}. (But there do**not**exists (n,k)-codes with minimum distance >d_{2}.)

Huge tables with parameters of linear codes can be found in

- Andries E. Brouwer: Bounds on the minimum distance of linear codes
- David Jaffe: Information about binary linear codes

harald.fripertinger "at" uni-graz.at, May 10, 2016

Generator
matrices of distance optimal binary codes |