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

DOI10.5802/ALCO.88MaRDI QIDQ2297554zbMATH OpenOpenAlexFDO

Authors Kai-Uwe Schmidt

Publication date 20 February 2020

Published in Algebraic Combinatorics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/1803.04274

zbMATH Keywords

quadratic formassociation schemecodedistance distributionsymmetric bilinear form

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Quadratic and bilinear forms, inner products (15A63) Cyclic codes (94B15) Group actions on combinatorial structures (05E18)

Abstract: Let $mathscrQ(m,q)$ and $mathscrS(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 $mathscrQ(m,q)$ and $mathscrS(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 $mathscrQ(m,q)$ or $mathscrS(m,q)$ with the property that, for all distinct $A,BinX$, 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.

Recommendations

• Symmetric bilinear forms over finite fields with applications to coding theory
• Association schemes of quadratic forms and symmetric bilinear forms
• Eigenvalues of association schemes of quadratic forms
• Association Schemes, Orthogonal Arrays and Codes from Non‐Degenerate Quadrics and Hermitian Varieties in Finite Projective Geometries
• Symmetric bilinear forms over finite fields of even characteristic

Cites work

• scientific article; zbMATH DE number 3884178 (Why is no real title available?)
• scientific article; zbMATH DE number 3135133 (Why is no real title available?)
• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• scientific article; zbMATH DE number 2232233 (Why is no real title available?)
• A course in combinatorics.
• A partially ordered set and q-Krawtchouk polynomials
• Alternating bilinear forms over GF(q)
• An analogue of Vosper's theorem for extension fields
• Association schemes and coding theory
• Association schemes of quadratic forms
• Association schemes of quadratic forms and symmetric bilinear forms
• Eigenvalues of association schemes of quadratic forms
• Orthogonal Matrices Over Finite Fields
• Properties and Applications of the Recurrence $F( {i + 1,k + 1,n + 1} ) = q^{k + 1} F( {i,k + 1,n} ) - q^k F( {i,k,n} )$
• Quantum error correction
• Some q-Krawtchouk Polynomials on Chevalley Groups
• Symmetric and Alternate Matrices in An Arbitrary Field, I
• Symmetric bilinear forms over finite fields of even characteristic
• Symmetric bilinear forms over finite fields with applications to coding theory
• The eigenmatrix of the linear association scheme on \(R(2,m)\)
• The minimum distance of some narrow-sense primitive BCH codes
• The weight enumerators for certain subcodes of the second order binary Reed-Muller codes
• The weight enumerators for several classes of subcodes of the 2nd order binary Reed-Muller codes

Cited in

(11)

• Maximal sets of pairwise orthogonal vectors in finite fields
• Linear codes associated to symmetric determinantal varieties: even rank case
• Vectorial bent functions and linear codes from quadratic forms
• Packings and Steiner systems in polar spaces
• Eigenvalues of association schemes of quadratic forms
• Association schemes of quadratic forms and symmetric bilinear forms
• Symmetric bilinear forms over finite fields with applications to coding theory
• On symmetric and Hermitian rank distance codes
• Symmetric bilinear forms over finite fields of even characteristic
• Higher-degree symmetric rank-metric codes
• Common Complements of Linear Subspaces and the Sparseness of MRD Codes

Describes a project that uses

Uses Software

• Code Tables

This page was built for publication: Quadratic and symmetric bilinear forms over finite fields and their association schemes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2297554)