2000 character limit reached
Graver Bases and Universal Gröbner Bases for Linear Codes (1401.6304v2)
Published 24 Jan 2014 in math.AC, cs.IT, and 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.