| [176933] |
| Title: Groebner bases for quaternary codes. |
| Written by: Robert Leppert, Mehwish Saleemi and Karl-Heinz Zimmermann |
| in: <em>International Journal of Pure and Applied Mathematics (IJPAM)</em>. October (2011). |
| Volume: <strong>71</strong>. Number: (4), |
| on pages: 595-608 |
| Chapter: |
| Editor: |
| Publisher: AP: |
| Series: 20111005-leppert-ijpam.pdf |
| Address: |
| Edition: |
| ISBN: |
| how published: 11-55 LSZ11 IJPAM |
| Organization: |
| School: |
| Institution: |
| Type: |
| DOI: |
| URL: |
| ARXIVID: |
| PMID: |
Note: rleppert, khzimmermann, AEG
Abstract: A linear code 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 for the corresponding code. In this paper, an analogue result will be presented for quaternary codes.