Linear codes associated to skew-symmetric determinantal varieties

Peter Beelen*, Prasant Singh

*Corresponding author for this work

Research output: Contribution to journalJournal articleResearchpeer-review

37 Downloads (Pure)

Abstract

In this article we consider linear codes coming from skew-symmetric determinantal varieties, which are defined by the vanishing of minors of a certain fixed size in the space of skew-symmetric matrices. In odd characteristic, the minimum distances of these codes are determined and a recursive formula for the weight of a general codeword in these codes is given.

Original languageEnglish
JournalFinite fields and their applications
Volume58
Pages (from-to)32-45
ISSN1071-5797
DOIs
Publication statusPublished - 1 Jul 2019

Keywords

  • Determinantal variety
  • Linear code
  • Minimum distance
  • Skew-symmetric matrices

Fingerprint Dive into the research topics of 'Linear codes associated to skew-symmetric determinantal varieties'. Together they form a unique fingerprint.

Cite this