Graver Bases and Universal Gr\"obner Bases for Linear Codes
Commutative Algebra
2014-05-08 v2 Information Theory
math.IT
Abstract
Two correspondences have been provided that associate any linear code over a finite field with a binomial ideal. In this paper, algorithms for computing their Graver bases and universal Gr\"obner bases are given. To this end, a connection between these binomial ideals and toric ideals will be established.
Cite
@article{arxiv.1401.6304,
title = {Graver Bases and Universal Gr\"obner Bases for Linear Codes},
author = {Natalia Dück and Karl-Heinz Zimmermann},
journal= {arXiv preprint arXiv:1401.6304},
year = {2014}
}
Comments
18 pages