#### Filter Results:

- Full text PDF available (3)

#### Publication Year

2013

2015

- This year (0)
- Last five years (5)

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Natalia Dück, Karl-Heinz Zimmermann
- ArXiv
- 2014

Recently, it was shown that a binary linear code can be associated to a binomial ideal given as the sum of a toric ideal and a non-prime ideal. Since then two different generalizations have been provided which coincide for the binary case. In this paper, we establish some connections between the two approaches. In particular, we show that the corresponding… (More)

- Natalia Dück, Karl-Heinz Zimmermann
- ArXiv
- 2014

Linear codes over any finite field can be associated to binomial ideals. Focussing on two specific instances, called the code ideal and the generalized code ideal, we present how these binomial ideals can be computed from toric ideals by substituting some variables. Drawing on this result we further show how their Graver bases as well as their universal… (More)

- Natalia Dück, Karl-Heinz Zimmermann
- ArXiv
- 2013

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.

- Natalia Dück, Karl-Heinz Zimmermann
- Des. Codes Cryptography
- 2015

- Natalia Dück, Irene Marquez Corbella, Edgar Martínez-Moro
- ACM Comm. Computer Algebra
- 2015

- ‹
- 1
- ›