Linear Codes Associated to Skew-symmetric Determinantal Varieties
Combinatorics
2018-10-10 v1
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.
Keywords
Cite
@article{arxiv.1810.03878,
title = {Linear Codes Associated to Skew-symmetric Determinantal Varieties},
author = {Peter Beelen and Prasant Singh},
journal= {arXiv preprint arXiv:1810.03878},
year = {2018}
}