Algebraic methods for parameterized codes and invariants of vanishing ideals over finite fields

From MaRDI portal
Publication:620935

DOI10.1016/J.FFA.2010.09.007zbMATH Open1209.13037arXiv1001.1448OpenAlexW2115476711MaRDI QIDQ620935FDOQ620935


Authors: Rafael H. Villarreal, Carlos Rentería Márquez, Aron Simis Edit this on Wikidata


Publication date: 2 February 2011

Published in: Finite Fields and their Applications (Search for Journal in Brave)

Abstract: Let K be a finite field with q elements and let X be a subset of a projective space P^{s-1}, over the field K, which is parameterized by Laurent monomials. Let I(X) be the vanishing ideal of X. Some of the main contributions of this paper are in determining the structure of I(X) and some of their invariants. It is shown that I(X) is a lattice ideal. We introduce the notion of a parameterized code arising from X and present algebraic methods to compute and study its dimension, length and minimum distance. For a parameterized code arising from a connected graph we are able to compute its length and to make our results more precise. If the graph is non-bipartite, we show an upper bound for the minimum distance. We also study the underlying geometric structure of X.


Full work available at URL: https://arxiv.org/abs/1001.1448




Recommendations




Cites Work


Cited In (41)

Uses Software





This page was built for publication: Algebraic methods for parameterized codes and invariants of vanishing ideals over finite fields

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q620935)