@article{DuZi14d,
author = {Natalia D&uuml;ck and Karl-Heinz Zimmermann},
title = {Heuristic decoding of linear codes using commutative algebra.},
journal = {Designs, Codes and Cryptography (DCC).},
year = {2014},
volume = {76.},
number = {(1),},
pages = {23-35},
month = {July},
note = {khzimmermann, AEG},
publisher = {Springer:},
isbn = {10.1007/s10623-014-0008-8},
howpublished = {14-35 DuZi14d DCC},
abstract = {Each binary linear code can be associated to a binomial ideal which allows for a complete decoding. Two generalizations of the non-binary case given by the ordinary and generalized code ideals have been given which coincide in the binary case and are related by elimination. The approach based on the generalized code ideal provides complete decoding but can be rather cumbersome. In this paper, a new heuristic decoding method based on the ordinary code ideal will be given which can be much faster.}
}

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