Graver Bases and Universal Gr\"obner Bases for Linear Codes
  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. 
Natalia D\"uck and Karl-Heinz Zimmermann
math.AC cs.IT math.IT