A type of recurring relation on sequences and efficient decoding of a class of algebraic-geometric codes. II (Q1283084): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf02917055 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3112130401 / rank | |||
Normal rank | |||
Latest revision as of 10:58, 30 July 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. II |
scientific article |
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
