Please use this identifier to cite or link to this item:
https://doi.org/10.15480/882.2249
| Publisher DOI: | 10.12732/ijpam.v98i4.2 | Title: | Graver bases and niversal Gröbner bases for linear codes | Language: | English | Authors: | Dück, Natalia Zimmermann, Karl-Heinz |
Keywords: | gröbner basis;graver basis;universal gröbner basis;linear code | Issue Date: | 2015 | Publisher: | Academic Publ. | Source: | International Journal of Pure and Applied Mathematics 4 (98): 419-441 (2015) | Journal or Series Name: | International journal of pure and applied mathematics | Abstract (english): | 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. | URI: | http://hdl.handle.net/11420/2661 | DOI: | 10.15480/882.2249 | ISSN: | 1314-3395 | Institute: | Eingebettete Systeme E-13 | Type: | (wissenschaftlicher) Artikel | License: | CC BY 4.0 (Attribution) |
| Appears in Collections: | Publications with fulltext |
Show full item record
Page view(s)
145
Last Week
1
1
Last month
1
1
checked on Aug 11, 2020
Download(s)
90
checked on Aug 11, 2020
Google ScholarTM
Check
Note about this record
Export
This item is licensed under a Creative Commons License
