Ideal forms of Coppersmith's theorem and Guruswami-Sudan list decoding (Q2516785): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.3934/amc.2015.9.311 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.3934/AMC.2015.9.311 / rank | |||
Normal rank | |||
Revision as of 03:43, 19 December 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
0 references
0 references
0 references
