Linear codes associated to symmetric determinantal varieties: even rank case

From MaRDI portal
Publication:6136691

DOI10.1016/J.FFA.2023.102240arXiv2106.11080OpenAlexW3175020146MaRDI QIDQ6136691FDOQ6136691

Peter Beelen, Prasant Singh, Trygve Johnsen

Publication date: 31 August 2023

Published in: Finite Fields and their Applications (Search for Journal in Brave)

Abstract: We consider linear codes over a finite field mathbbFq, 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.


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







Cites Work


Cited In (1)





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)