Quadratic and symmetric bilinear forms over finite fields and their association schemes
Kai‐Uwe Schmidt
Abstract
Open-access reader
Kai‐Uwe Schmidt
Abstract
Open-access reader
Let 𝒬 ( m , q ) and 𝒮 ( m , q ) be the sets of quadratic forms and symmetric bilinear forms on an m -dimensional vector space over 𝔽 q , respectively. The orbits of 𝒬 ( m , q ) and 𝒮 ( 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 𝒬 ( m , q ) or 𝒮 ( m , q ) with the property that, for all distinct A , B ∈ 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 𝔽 q can be determined from the results of this paper.
OpenAlex reports 3 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Let 𝒬 ( m , q ) and 𝒮 ( m , q ) be the sets of quadratic forms and symmetric bilinear forms on an m -dimensional vector space over 𝔽 q , respectively. The orbits of 𝒬 ( m , q ) and 𝒮 ( 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 𝒬 ( m , q ) or 𝒮 ( m , q ) with the property that, for all distinct A , B ∈ 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 𝔽 q can be determined from the results of this paper.
Key concepts: Association scheme, Mathematics, Bilinear form, Combinatorics, Vector space, Symmetric bilinear form, Rank (graph theory), Space (punctuation)