arXiv · 1401.6304
Graver Bases and Universal Gröbner Bases for Linear Codes
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öbner bases are given. To this end, a connection between these binomial ideals and toric ideals will be established.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Natalia Dück, Karl-Heinz Zimmermann. 2014-05-07. Graver Bases and Universal Gröbner Bases for Linear Codes. https://arxiv.org/abs/1401.6304
Cite the original work for its findings. Save a collection to share your selection of sources.