Linear Codes with Prescribed Hull Dimension and Minimum Distance

05/11/2023
βˆ™
by   Ghurumuruhan Ganesan, et al.
βˆ™
0
βˆ™

The hull of a linear code (i.e., a finite field vector space)Β π’ž is defined to be the vector space formed by the intersection ofΒ π’ž with its dualΒ π’ž^βŠ₯. Constructing vector spaces with a specified hull dimension has important applications and it is therefore of interest to study minimum distance properties of such spaces. In this paper, we use the probabilistic method to obtain spaces with a given hull dimension and minimum distance and also derive Gilbert-Varshamov type sufficient conditions for their existence.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
βˆ™ 05/09/2020

On the Grassmann Graph of Linear Codes

Let Ξ“(n,k) be the Grassmann graph formed by the k-dimensional subspaces ...
research
βˆ™ 10/17/2018

Properties of Constacyclic Codes Under the Schur Product

For a subspace W of a vector space V of dimension n, the Schur-product s...
research
βˆ™ 07/30/2022

Compressible Topological Vector Spaces

The optimum subspace decomposition of the infinite-dimensional compressi...
research
βˆ™ 01/22/2022

Solvability of orbit-finite systems of linear equations

We study orbit-finite systems of linear equations, in the setting of set...
research
βˆ™ 01/15/2023

On the graph of non-degenerate linear [n,2]_2 codes

Consider the Grassmann graph of k-dimensional subspaces of an n-dimensio...
research
βˆ™ 09/24/2020

Constructing Positive Interpolatory Cubature Formulas

Positive interpolatory cubature formulas (CFs) are constructed for quite...
research
βˆ™ 09/18/2013

A constructive approach to triangular trigonometric patches

We construct a constrained trivariate extension of the univariate normal...

Please sign up or login with your details

Forgot password? Click here to reset