A type of recurring relation on sequences and efficient decoding of a class of algebraic-geometric codes. I (Q1286655)
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: A type of recurring relation on sequences and efficient decoding of a class of algebraic-geometric codes. I |
scientific article; zbMATH DE number 1281404
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A type of recurring relation on sequences and efficient decoding of a class of algebraic-geometric codes. I |
scientific article; zbMATH DE number 1281404 |
Statements
A type of recurring relation on sequences and efficient decoding of a class of algebraic-geometric codes. I (English)
0 references
26 November 2000
0 references
decoding
0 references
algebraic-geometric codes
0 references
recurring relation
0 references
minimal polynomial set
0 references
algorithm
0 references
Berlekamp-Massey algorithm
0 references
complexity
0 references
0 references
0.8841917514801025
0 references
0.8030872941017151
0 references
0.802419126033783
0 references
