Symmetric bilinear forms over finite fields with applications to coding theory

DOI10.1007/S10801-015-0595-0zbMATH Open1319.05155arXiv1410.7184OpenAlexW2162150928MaRDI QIDQ494308FDOQ494308

Authors: Kai-Uwe Schmidt 

Publication date: 31 August 2015

Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)

Abstract: Let $q$ be an odd prime power and let $X(m,q)$ be the set of symmetric bilinear forms on an $m$-dimensional vector space over $mathbb{F}_q$. The partition of $X(m,q)$ induced by the action of the general linear group gives rise to a commutative translation association scheme. We give explicit expressions for the eigenvalues of this scheme in terms of linear combinations of generalised Krawtchouk polynomials. We then study $d$-codes in this scheme, namely subsets $Y$ of $X(m,q)$ with the property that, for all distinct $A,BinY$, the rank of $A-B$ is at least $d$. We prove bounds on the size of a $d$-code and show that, under certain conditions, the inner distribution of a $d$-code is determined by its parameters. Constructions of $d$-codes are given, which are optimal among the $d$-codes that are subgroups of $X(m,q)$. Finally, with every subset $Y$ of $X(m,q)$, we associate two classical codes over $mathbb{F}_q$ and show that their Hamming distance enumerators can be expressed in terms of the inner distribution of $Y$. As an example, we obtain the distance enumerators of certain cyclic codes, for which many special cases have been previously obtained using long ad hoc calculations.

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

Recommendations

• On symmetric algorithms for bilinear forms over finite fields
• Symmetric bilinear forms over finite fields of even characteristic
• Bilinear forms and linear codes
• Quadratic and symmetric bilinear forms over finite fields and their association schemes
• Computational complexity of bilinear forms. Algebraic coding theory and applications to digital communication systems
• A construction of binary linear codes in finite fields
• Coding theory and algebraic curves over finite fields
• Linear codes over finite fields and finite projective geometries
• Linear structures of symmetric functions over finite fields
• Construction of binary linear codes via rational function fields

zbMATH Keywords

quadratic formassociation schemecodeweight enumeratorsymmetric 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)

Cites Work

• A course in combinatorics.
• Weight distribution of some reducible cyclic codes
• The Weight Distribution of a Class of Cyclic Codes Related to Hermitian Forms Graphs
• On the Weight Distributions of Two Classes of Cyclic Codes
• Cyclic Codes and Sequences From Generalized Coulter–Matthews Function
• Title not available (Why is that?)
• Cyclic Codes and Sequences: The Generalized Kasami Case
• Title not available (Why is that?)
• The weight distribution of a class of \(p\)-ary cyclic codes
• Bilinear forms over a finite field, with applications to coding theory
• Title not available (Why is that?)
• Title not available (Why is that?)
• Association schemes and coding theory
• Title not available (Why is that?)
• Hahn Polynomials, Discrete Harmonics, andt-Designs
• Determining the Nonlinearity of a New Family of APN Functions
• On generalized ReedMuller codes and their relatives
• A partially ordered set and q-Krawtchouk polynomials
• Association schemes and t-designs in regular semilattices
• Alternating bilinear forms over GF(q)
• Symmetric bilinear forms over finite fields of even characteristic
• Representation by quadratic forms in a finite field
• A class of five-weight cyclic codes and their weight distribution
• 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} )$
• A Family of Five-Weight Cyclic Codes and Their Weight Enumerators
• Rank properties of subspaces of symmetric and Hermitian matrices over finite fields
• Prime-phase sequences with periodic correlation properties better than binary sequences
• The weight distributions of some cyclic codes with three or four nonzeros over \(\mathbb F_3\)
• The weight distribution of a family of \(p\)-ary cyclic codes
• Association schemes of quadratic forms and symmetric bilinear forms
• The weight distributions of a class of cyclic codes with three nonzeros over \(\mathbb{F}_3\)
• Commutative association schemes
• t-designs in classical association schemes
• An analogue of t-designs in the association schemes of alternating bilinear forms
• Association schemes of symmetric matrices over a finite field of characteristic two
• Title not available (Why is that?)
• Non-symmetric association schemes of symmetric matrices

Cited In (26)

• The weight distribution of a class of \(p\)-ary cyclic codes and their applications
• The minimum distance of some narrow-sense primitive BCH codes
• Quadratic and symmetric bilinear forms over finite fields and their association schemes
• An analogue of Vosper's theorem for extension fields
• Vectorial bent functions and linear codes from quadratic forms
• Automorphism groups and new constructions of maximum additive rank metric codes with restrictions
• Endomorphisms and cores of quadratic forms graphs in odd characteristic
• Hermitian rank distance codes
• A class of constacyclic BCH codes
• The weight distributions of two classes of \(p\)-ary cyclic codes with few weights
• On symmetric algorithms for bilinear forms over finite fields
• The metric structure of linear codes
• A new family of linear maximum rank distance codes
• Algebraic structures of MRD codes
• On maximum additive Hermitian rank-metric codes
• On symmetric and Hermitian rank distance codes
• On equivalence of maximum additive symmetric rank-distance codes
• Symmetric bilinear forms over finite fields of even characteristic
• Higher-degree symmetric rank-metric codes
• Rank-Metric Codes, Semifields, and the Average Critical Problem
• A class of narrow-sense BCH codes over \(\mathbb{F}_q\) of length \(\frac{q^m-1}{2} \)
• Symmetric polynomials over \(\mathbb Z_{m}\) and simultaneous communication protocols
• Constructions of linear codes with small hulls from association schemes
• On distributions of covariance structures
• Encoding and decoding of several optimal rank metric codes
• Bilinear forms and linear codes

This page was built for publication: Symmetric bilinear forms over finite fields with applications to coding theory

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