Bounded distance decoding of linear error-correcting codes with Gröbner bases (Q733503)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Bounded distance decoding of linear error-correcting codes with Gröbner bases |
scientific article; zbMATH DE number 5616449
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Bounded distance decoding of linear error-correcting codes with Gröbner bases |
scientific article; zbMATH DE number 5616449 |
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
0 references
0 references
0 references
0.9051097631454468
0 references
0.8777523636817932
0 references
0.8556183576583862
0 references
0.8481380939483643
0 references
