Linear codes associated to skew-symmetric determinantal varieties

Research output: Contribution to journalJournal article – Annual report year: 2019Researchpeer-review

View graph of relations

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
CitationsWeb of Science® Times Cited: No match on DOI

    Research areas

  • Determinantal variety, Linear code, Minimum distance, Skew-symmetric matrices
Download as:
Download as PDF
Select render style:
APAAuthorCBE/CSEHarvardMLAStandardVancouverShortLong
PDF
Download as HTML
Select render style:
APAAuthorCBE/CSEHarvardMLAStandardVancouverShortLong
HTML
Download as Word
Select render style:
APAAuthorCBE/CSEHarvardMLAStandardVancouverShortLong
Word

ID: 172882023