A type of recurring relation on sequences and efficient decoding of a class of algebraic-geometric codes. II (Q1283084)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1274859
| 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. II |
scientific article; zbMATH DE number 1274859 |
Statements
A type of recurring relation on sequences and efficient decoding of a class of algebraic-geometric codes. II (English)
0 references
26 November 2000
0 references
algebraic-geometric codes
0 references
recurring relation
0 references
majority voting scheme
0 references
generalized Berlekamp-Massey algorithm
0 references
decoding algorithms
0 references
Feng-Rao bound
0 references
complexity
0 references
0 references
0 references
0 references
0 references
0.8841917514801025
0 references
0.882706344127655
0 references
0.8725335001945496
0 references
0.8675735592842102
0 references
