Linear codes associated to symmetric determinantal varieties: even rank case
From MaRDI portal
Publication:6136691
Abstract: We consider linear codes over a finite field , for odd , 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 , are given.
Recommendations
Cites work
- scientific article; zbMATH DE number 3737831 (Why is no real title available?)
- scientific article; zbMATH DE number 1009714 (Why is no real title available?)
- scientific article; zbMATH DE number 1101474 (Why is no real title available?)
- Algebraic geometric codes. Basic notions
- Hyperplane sections of determinantal varieties over finite fields and linear codes
- Linear codes associated to determinantal varieties
- Linear codes associated to skew-symmetric determinantal varieties
- On symmetric and skew-symmetric determinantal varieties
- Orthogonal Matrices Over Finite Fields
- Quadratic and symmetric bilinear forms over finite fields and their association schemes
This page was built for publication: Linear codes associated to symmetric determinantal varieties: even rank case
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6136691)