Schmidt, NataliaNataliaSchmidtZimmermann, Karl-HeinzKarl-HeinzZimmermann2021-06-292021-06-292015-07-01Designs, Codes, and Cryptography 76 (1): 23-35 (2015-07-01)http://hdl.handle.net/11420/9814Each 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.en0925-1022201512335Binomial idealGröbner basisHeuristic decodingLinear codeJournal Article10.1007/s10623-014-0008-8Journal Article