Bounded distance decoding of linear error-correcting codes with Gröbner bases (Q733503): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: SINGULAR / rank | |||
Normal rank | |||
Revision as of 00:17, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Bounded distance decoding of linear error-correcting codes with Gröbner bases |
scientific article |
Statements
Bounded distance decoding of linear error-correcting codes with Gröbner bases (English)
0 references
16 October 2009
0 references
The authors present a new method for bounded distance decoding of arbitrary linear codes using Grobner bases. Their method is based on reducing an initial decoding problem to solving a specified system of polynomial equations over a finite field, wherein the equations have degree at most \(2\). their method is faster than previous methods and is purported to be superior to generic syndrome decoding.
0 references
decoding
0 references
Gröbner basis
0 references
linear code
0 references
minimum distance
0 references
syndrome decoding
0 references
system of polynomial equations
0 references
