| [176890] |
| Title: Heuristic decoding of linear codes using commutative algebra. |
| Written by: Natalia Dück and Karl-Heinz Zimmermann |
| in: <em>Designs, Codes and Cryptography (DCC)</em>. July (2014). |
| Volume: <strong>76</strong>. Number: (1), |
| on pages: 23-35 |
| Chapter: |
| Editor: |
| Publisher: Springer: |
| Series: |
| Address: |
| Edition: |
| ISBN: 10.1007/s10623-014-0008-8 |
| how published: 14-35 DuZi14d DCC |
| Organization: |
| School: |
| Institution: |
| Type: |
| DOI: |
| URL: |
| ARXIVID: |
| PMID: |
Note: khzimmermann, AEG
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.