REVIEW 1 cited by
Quadratic and symmetric bilinear forms over finite fields and their association schemes
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
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.
Forward citations
Cited by 1 Pith paper
-
Automorphism groups and new constructions of maximum additive rank metric codes with restrictions
Automorphism groups and equivalence criteria are determined for four families of maximum additive rank-metric codes with symmetry restrictions, and a new maximum symmetric 2-code not equivalent to the prior one is con...
Discussion (0). Continue with ORCID to comment.