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
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q2762882 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Finding a minimal set of linear recurring relations capable of generating a given finite two-dimensional array / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Extension of the Berlekamp-Massey algorithm to N dimensions / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Shift-register synthesis and BCH decoding / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the decoding of algebraic-geometric codes / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Generalized Berlekamp-Massey decoding of algebraic-geometric codes up to half the Feng-Rao bound / rank | |||
Normal rank | |||
Latest revision as of 18:48, 28 May 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
0 references
