English

Quadratic and symmetric bilinear forms over finite fields and their association schemes

Combinatorics 2018-03-13 v1 Information Theory math.IT

Abstract

Let Q(m,q)\mathscr{Q}(m,q) and S(m,q)\mathscr{S}(m,q) be the sets of quadratic forms and symmetric bilinear forms on an mm-dimensional vector space over Fq\mathbb{F}_q, respectively. The orbits of Q(m,q)\mathscr{Q}(m,q) and S(m,q)\mathscr{S}(m,q) under a natural group action induce two translation association schemes, which are known to be dual to each other. We give explicit expressions for the eigenvalues of these association schemes in terms of linear combinations of generalised Krawtchouk polynomials, generalising earlier results for odd qq to the more difficult case when qq is even. We then study dd-codes in these schemes, namely subsets XX of Q(m,q)\mathscr{Q}(m,q) or S(m,q)\mathscr{S}(m,q) with the property that, for all distinct A,BXA,B\in X, the rank of ABA-B is at least dd. We prove tight bounds on the size of dd-codes and show that, when these bounds hold with equality, the inner distributions of the subsets are often uniquely determined by their parameters. We also discuss connections to classical error-correcting codes and show how the Hamming distance distribution of large classes of codes over Fq\mathbb{F}_q can be determined from the results of this paper.

Keywords

Cite

@article{arxiv.1803.04274,
  title  = {Quadratic and symmetric bilinear forms over finite fields and their association schemes},
  author = {Kai-Uwe Schmidt},
  journal= {arXiv preprint arXiv:1803.04274},
  year   = {2018}
}

Comments

33 pages