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 language | English |
---|---|
Journal | Finite Fields and Their Applications |
Volume | 58 |
Pages (from-to) | 32-45 |
ISSN | 1071-5797 |
DOIs | |
Publication status | Published - 1 Jul 2019 |
Keywords
- Determinantal variety
- Linear code
- Minimum distance
- Skew-symmetric matrices