Linear Codes Associated to Symmetric Determinantal Varieties: Even Rank Case

06/21/2021
by   Peter Beelen, et al.
0

We consider linear codes over a finite field 𝔽_q, for odd q, derived from determinantal varieties, obtained from symmetric matrices of bounded ranks. A formula for the weight of a codeword is derived. Using this formula, we have computed the minimum distance for the codes corresponding to matrices upperbounded by any fixed, even rank. A conjecture is proposed for the cases where the upper bound is odd. At the end of the article, tables for the weights of these codes, for spaces of symmetric matrices up to order 5, are given.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

11/13/2020

On symmetric and Hermitian rank distance codes

Let M denote the set S_n, q of n × n symmetric matrices with entries in ...
07/30/2019

Linear codes of 2-designs associated with subcodes of the ternary generalized Reed-Muller codes

In this paper, the 3-rank of the incidence matrices of 2-designs support...
02/06/2020

Roos bound for skew cyclic codes in Hamming and rank metric

In this paper, a Roos like bound on the minimum distance for skew cyclic...
04/02/2018

Maximal Ferrers Diagram Codes: Constructions and Genericity Considerations

This paper investigates the construction of rank-metric codes with speci...
08/09/2019

Extending the Davis-Kahan theorem for comparing eigenvectors of two symmetric matrices I: Theory

The Davis-Kahan theorem can be used to bound the distance of the spaces ...
10/17/2018

The rank of random matrices over finite fields

We determine the rank of a random matrix A over a finite field with pres...
02/04/2021

Decoding of Space-Symmetric Rank Errors

This paper investigates the decoding of certain Gabidulin codes that wer...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.