http://10.10.120.238:8080/xmlui/handle/123456789/415| DC Field | Value | Language |
|---|---|---|
| dc.rights.license | All Open Access, Green | - |
| dc.contributor.author | Beelen P. | en_US |
| dc.contributor.author | Johnsen T. | en_US |
| dc.contributor.author | Singh P. | en_US |
| dc.date.accessioned | 2023-11-30T08:32:29Z | - |
| dc.date.available | 2023-11-30T08:32:29Z | - |
| dc.date.issued | 2023 | - |
| dc.identifier.issn | 1071-5797 | - |
| dc.identifier.other | EID(2-s2.0-85162133844) | - |
| dc.identifier.uri | https://dx.doi.org/10.1016/j.ffa.2023.102240 | - |
| dc.identifier.uri | http://localhost:8080/xmlui/handle/123456789/415 | - |
| dc.description.abstract | We consider linear codes over a finite field Fq, for odd q, derived from determinantal varieties, obtained from symmetric matrices of bounded ranks. A formula for the weight of a codeword is derived. Using this formula, we have computed the minimum distance for the codes corresponding to matrices upperbounded by any fixed, even rank. A conjecture is proposed for the cases where the upper bound is odd. At the end of the article, tables for the weights of these codes, for spaces of symmetric matrices up to order 5, are given. © 2023 Elsevier Inc. | en_US |
| dc.language.iso | en | en_US |
| dc.publisher | Academic Press Inc. | en_US |
| dc.source | Finite Fields and their Applications | en_US |
| dc.subject | Linear code | en_US |
| dc.subject | Minimum distance | en_US |
| dc.subject | Symmetric determinantal varieties | en_US |
| dc.subject | Symmetric matrices | en_US |
| dc.title | Linear codes associated to symmetric determinantal varieties: Even rank case | en_US |
| dc.type | Journal Article | en_US |
| Appears in Collections: | Journal Article | |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.