@article{DuZi13a,
author = {Natalia Dück and Karl-Heinz Zimmermann},
title = {Computing generating sets for quaternary codes using Gröbner bases.},
journal = {International Journal of Pure and Applied Mathematics (IJPAM).},
year = {2013},
volume = {84.},
number = {(1),},
pages = {99-109},
month = {April},
note = {khzimmermann, AEG},
publisher = {AP:},
series = {20130402-dueck-ijpam.pdf},
isbn = {10.12732/ijpam.v84i1.7},
howpublished = {13-90 DuZi13a IJPAM},
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.}
}

@COMMENT{Bibtex file generated on 2026-6-28 with typo3 si_bibtex plugin. Data from https://www.tuhh.de/es/home/publications }