This page is supposed to be a comprehensive database of self-dual codes with the highest known minimum distance. Therefore this place should be in constant change and any questions, suggestions or precisions are welcome. 1. INTRODUCTION 1. INTRODUCTION
Let GF(q) be the Galois field with q elements and o be an
automorphism of GF(q). A bilinear form on the vector
space GF(q)^{n} is a map
f : GF(q)^{n}xGF(q)^{n}->GF(q)
such that for all x,y,z in GF(q)^{n} and
all a in GF(q), we have:
f(x+y,z) = f(x,z)+f(y,z)
f(ax,z) = af(ax,z)
f(x,y+z) = f(x,y)+f(x,z) f(x,az) = af(x,z).
The form f is symmetric if f is bilinear and
f(x,y) Example The usual inner product of vectors x=(x_{1},...,x_{n}) and y=(y_{1},...,y_{n}) in GF(q)^{n} defined by
x.y
is a nondegenerate symmetric form called the euclidian scalar product.
A linear code of length n and dimension k is a k-dimensional subspace of GF(q)^{n}. The elements of a code are its codewords. The Hamming weight of x=(x_{1},...,x_{n}) in GF(q)^{n} is the number of its non-zero coordinates and the minimum distance d(C) of a code C is the minimum of the non-zero weights of its codewords. A self-dual code is a code that is equal to its orthogonal. For those who desire more informations should refer to the the chapter "Self-dual codes" written by E.M. Rains and N.J.A. Sloane in Handbook of Coding Theory edited by V.S. Pless and W.C. Huffman, (Amsterdam: Elsevier, 1998, pp. 177-294). 2. GENERAL CONSTRUCTIONS3. TABLES
GF(2)^{n} is equipped with the euclidian scalar product. You can find an up to date table of self-dual binary codes with the highest known minimum distance here
GF(3)^{n} is equipped with the euclidian scalar product. You can find an up to date table of self-dual codes with the highest known minimum distance here
GF(5)^{n} is equipped with the euclidian scalar product. You can find an up to date table of self-dual codes with the highest known minimum distance here
GF(7)^{n} is equipped with the euclidian scalar product. You can find an up to date table of self-dual codes with the highest known minimum distance here |