| [176941] |
| Title: Groebner bases for linear codes. |
| Written by: Mehwish Saleemi and Karl-Heinz Zimmermann |
| in: <em>International Journal of Pure and Applied Mathematics (IJPAM)</em>. August (2010). |
| Volume: <strong>62</strong>. Number: (4), |
| on pages: 481-491 |
| Chapter: |
| Editor: |
| Publisher: AP: |
| Series: 20100801-saleemi-ijpam.pdf |
| Address: |
| Edition: |
| ISBN: |
| how published: 10-30 SaZi10c IJPAM |
| Organization: |
| School: |
| Institution: |
| Type: |
| DOI: |
| URL: |
| ARXIVID: |
| PMID: |
Note: khzimmermann, AEG
Abstract: Each linear code can be described by a binomial ideal given as the sum of a toric ideal and a non-prime ideal. In this paper, we show that each such binomial ideal has a very natural reduced Groebner basis which can be easily constructed from a systematic generator matrix of the code.