arXiv Analytics

Sign in

arXiv:1803.04274 [math.CO]AbstractReferencesReviewsResources

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

Kai-Uwe Schmidt

Published 2018-03-12Version 1

Let $\mathscr{Q}(m,q)$ and $\mathscr{S}(m,q)$ be the sets of quadratic forms and symmetric bilinear forms on an $m$-dimensional vector space over $\mathbb{F}_q$, respectively. The orbits of $\mathscr{Q}(m,q)$ and $\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 $q$ to the more difficult case when $q$ is even. We then study $d$-codes in these schemes, namely subsets $X$ of $\mathscr{Q}(m,q)$ or $\mathscr{S}(m,q)$ with the property that, for all distinct $A,B\in X$, the rank of $A-B$ is at least $d$. We prove tight bounds on the size of $d$-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 $\mathbb{F}_q$ can be determined from the results of this paper.

Related articles: Most relevant | Search more
arXiv:0904.0441 [math.CO] (Published 2009-04-02)
The sovability of norm, bilinear and quadratic equations over finite fields via spectra of graphs
arXiv:math/9910056 [math.CO] (Published 1999-10-11)
Lamps, Factorizations and Finite Fields
arXiv:1403.6138 [math.CO] (Published 2014-03-24, updated 2015-02-04)
On the sums of any k points in finite fields