On the decoding of binary cyclic codes with the Newton identities (Q733502): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: FGb / rank | |||
Normal rank | |||
Revision as of 17:03, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the decoding of binary cyclic codes with the Newton identities |
scientific article |
Statements
On the decoding of binary cyclic codes with the Newton identities (English)
0 references
16 October 2009
0 references
The authors look at decoding binary cyclic codes with Gröbner bases. They study, in particular, properties defined by Newton identities for decoding binary cyclic codes. In a two-step process involving varieties and Gröbner bases, they provide an efficient practical procedure. They conclude with some computational results for codes of length approximately one hundred.
0 references
cyclic codes
0 references
quadratic residue codes
0 references
elimination theory
0 references
Gröbner basis
0 references
\(F4\) algorithm
0 references
