Graver bases and niversal Gröbner bases for linear codes
Citation Link: https://doi.org/10.15480/882.2249
Publikationstyp
Journal Article
Date Issued
2015
Sprache
English
Author(s)
Institut
TORE-DOI
TORE-URI
Volume
98
Issue
4
Start Page
419
End Page
442
Citation
International Journal of Pure and Applied Mathematics 4 (98): 419-441 (2015)
Publisher DOI
Scopus ID
Publisher
Academic Publications
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.
Subjects
gröbner basis
graver basis
universal gröbner basis
linear code
DDC Class
510: Mathematik