๐ฎ
๐ฎ
The Ethereal
Quadratic and symmetric bilinear forms over finite fields and their association schemes
March 12, 2018 ยท The Ethereal ยท ๐ Algebraic Combinatorics
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Kai-Uwe Schmidt
arXiv ID
1803.04274
Category
math.CO: Combinatorics
Cross-listed
cs.IT
Citations
20
Venue
Algebraic Combinatorics
Last Checked
2 months ago
Abstract
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.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
๐ Similar Papers
In the same crypt โ Combinatorics
๐ฎ
๐ฎ
The Ethereal
On cap sets and the group-theoretic approach to matrix multiplication
๐ฎ
๐ฎ
The Ethereal
Generalized Twisted Gabidulin Codes
๐ฎ
๐ฎ
The Ethereal
Tables of subspace codes
๐ฎ
๐ฎ
The Ethereal
Classification of weighted networks through mesoscale homological features
๐ฎ
๐ฎ
The Ethereal