| [176907] |
| Title: Computing generating sets for quaternary codes using Gröbner bases. |
| Written by: Natalia Dück and Karl-Heinz Zimmermann |
| in: <em>International Journal of Pure and Applied Mathematics (IJPAM)</em>. April (2013). |
| Volume: <strong>84</strong>. Number: (1), |
| on pages: 99-109 |
| Chapter: |
| Editor: |
| Publisher: AP: |
| Series: 20130402-dueck-ijpam.pdf |
| Address: |
| Edition: |
| ISBN: 10.12732/ijpam.v84i1.7 |
| how published: 13-90 DuZi13a IJPAM |
| Organization: |
| School: |
| Institution: |
| Type: |
| DOI: |
| URL: |
| ARXIVID: |
| PMID: |
Note: khzimmermann, AEG
Abstract: Gröbner bases techniques can be used to compute a basis of a subspace of a finite-dimensional vector space over finite prime field given as a matrix kernel. Linear codes can be described as such subspaces and thus are an interesting area of application. Based on this, Gröbner bases techniques will be used to compute a generating set of a quaternary code given as a matrix kernel. In particular, if the quaternary code is free, the algorithm will provide a basis for the dual code.