| [176927] |
| Title: Groebner bases for linear codes over GF(4). |
| Written by: Mehwish Saleemi and Karl-Heinz Zimmermann |
| in: <em>International Journal of Pure and Applied Mathematics (IJPAM)</em>. December (2011). |
| Volume: <strong>73</strong>. Number: (4), |
| on pages: 435-442 |
| Chapter: |
| Editor: |
| Publisher: AP: |
| Series: 20111201-saleemi-ijpam.pdf |
| Address: |
| Edition: |
| ISBN: |
| how published: 11-20 SaZi11 IJPAM |
| Organization: |
| School: |
| Institution: |
| Type: |
| DOI: |
| URL: |
| ARXIVID: |
| PMID: |
Note: khzimmermann, AEG
Abstract: A linear code over a prime field can be described by a binomial ideal in a polynomial ring given as the sum of a toric ideal and a nonprime ideal. A Groebner basis for such an ideal can be read off from a systematic generator matrix of the corresponding code. In this paper, a similar result will be presented for linear codes over GF(4). To this end, the extented alphabet GF(4) is dealt with by enlarging the polynomial ring.