Graver bases and niversal Gröbner bases for linear codes

Authors
Publication date
1 January 2015
Publisher
Academic Publ.
Doi

    Abstract

    A linear code over a finite field can be associated with two binomial ideals. In this paper, algorithms for computing their Graver bases and universal Gröbner bases are given

      Similar works

      Full text

      thumbnail-image

      Available Versions

      TUHH Open Research (TORE)

      redirect
      oaioai:tore.tuhh.de:11420/2661
      Last time updated on 14/09/2020

      Open Access Repository Technischen Universität Hamburg

      redirect
      oaioai:tore.tuhh.de:11420/2661
      Last time updated on 18/04/2020