Skip to Main content Skip to Navigation
Conference papers

On the weights of affine-variety codes and some Hermitian codes

Abstract : For any affine-variety code we show how to construct an ideal whose solutions correspond to codewords with any assigned weight. We use our ideal and a geometric characterization to determine the number of small-weight codewords for some families of Hermitian codes over any Fq. In particular, we determine the number of minimum-weight code- words for all Hermitian codes with d ≤ q. For such codes we also count some other small-weight codewords.
Complete list of metadata

Cited literature [7 references]  Display  Hide  Download
Contributor : Marie Trape Connect in order to contact the contributor
Submitted on : Wednesday, August 10, 2011 - 2:24:09 PM
Last modification on : Saturday, June 8, 2019 - 2:14:02 PM
Long-term archiving on: : Monday, November 12, 2012 - 3:16:38 PM


Files produced by the author(s)


  • HAL Id : inria-00614257, version 1



Marco Pellegrini, Chiara Marcolla, Massimiliano Sala. On the weights of affine-variety codes and some Hermitian codes. WCC 2011 - Workshop on coding and cryptography, Apr 2011, Paris, France. pp.273-282. ⟨inria-00614257⟩



Record views


Files downloads