A type of recurring relation on sequences and efficient decoding of a class of algebraic-geometric codes. I (Q1286655): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 11:33, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A type of recurring relation on sequences and efficient decoding of a class of algebraic-geometric codes. I |
scientific article |
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
