Name
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. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1016/j.ffa.2019.03.004 | Finite Fields and Their Applications |
Keywords | Field | DocType |
94B27,14G50 | Combinatorics,Skew-symmetric matrix,Matrix (mathematics),Linear code,Code word,Recursion,Mathematics | Journal |
Volume | ISSN | Citations |
58 | 1071-5797 | 0 |
PageRank | References | Authors |
0.34 | 0 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Peter Beelen | 1 | 116 | 15.95 |
| Prasant Singh | 2 | 2 | 1.80 |