Bounds on the minimum distance of linear codes

The following tables give lower and upper bounds for the minimum distance d of a linear [n,k,d] code over GF(q). They are copies of the tables given at http://codetables.de, which are maintained by Markus Grassl.

We want to visualize some improvements on the upper bounds given there since this data is based on the tables of Andries Brouwer. The achieved improvements are highlighted. A hover box gives you the proof or the reference for a proof, respectively.


University of Bayreuth -