Ideal forms of Coppersmith's theorem and Guruswami-Sudan list decoding (Q2516785): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 04:03, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Ideal forms of Coppersmith's theorem and Guruswami-Sudan list decoding |
scientific article |
Statements
Ideal forms of Coppersmith's theorem and Guruswami-Sudan list decoding (English)
0 references
4 August 2015
0 references
lattice basis reduction
0 references
Coppersmith's theorem
0 references
list decoding
0 references
polynomial equations
0 references
Guruswami-Sudan algorithm
0 references
Reed-Solomon codes
0 references
algorithm
0 references
