| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 403020 | Journal of Symbolic Computation | 2016 | 19 Pages |
Abstract
For any affine-variety code we show how to construct an ideal whose solutions correspond to codewords with any assigned weight. We are able to obtain geometric characterizations for small-weight codewords for some families of Hermitian codes over any Fq2Fq2. From these geometric characterizations, we obtain explicit formulas. In particular, we determine the number of minimum-weight codewords for all Hermitian codes with d≤qd≤q and all second-weight codewords for distance-3,43,4 codes.
Related Topics
Physical Sciences and Engineering
Computer Science
Artificial Intelligence
Authors
Chiara Marcolla, Marco Pellegrini, Massimiliano Sala,