arXiv subjects
Publications and source records attributed to Natalia Dück.
Two correspondences have been provided that associate any linear code over a finite field with a binomial ideal. In this paper, algorithms for computing their Graver bases and universal Gröbner bases are given. To this end, a connection between these binomial ideals and toric ideals will be established.
Each linear code can be described by a code ideal given as the sum of a toric ideal and a non-prime ideal. In this way, several concepts from the theory of toric ideals can be translated into the setting of code ideals. It will be shown that after adjusting some of these concepts, the same inclusion relationship between the set of circuits, the universal Gröbner basis and the Graver basis holds. Furthermore, in the case of binary linear codes, the universal Gröbner basis will consist of all binomials which correspond to codewords that satisfy the Singleton bound and a particular rank condition. This will give rise to a new class of binary linear codes denoted as Singleton codes.
Gröbner bases can be used for computing the Hilbert basis of a numerical submonoid. By using these techniques, we provide an algorithm that calculates a basis of a subspace of a finite-dimensional vector space over a finite prime field given as a matrix kernel.