|
8
|
Achieving the designed error capacity in decoding algebraic-geometric code
– D Ehrhard
- 1993
|
|
296
|
Algebraic function fields and codes
– H Stichtenoth
- 1993
|
|
351
|
Algebraic Coding Theory
– E R Berlekamp
- 1968
|
|
79
|
A tower of Artin-Schreier extensions of function fields attaining the Drinfeld-Vlǎdut¸ bound
– A Garcia, H Stichtenoth
- 1995
|
|
12
|
On a decoding algorithm for codes on maximal curves
– R Pellikaan
- 1989
|
|
16
|
Majority coset decoding
– Iwan M Duursma
- 1993
|
|
16
|
Decoding Algebraic Geometric Codes up to the Design Minimum Distance: Presented at AAECC-9
– G L Feng, T R N Rao
- 1991
|
|
22
|
Construction and decoding of a class of algebraic geometry codes
– J Justesen, K J Larsen, H E Jensen, A Havemose, T Høholdt
- 1989
|
|
5
|
Decoding codes arising from Goppa’s construction on algebraic curves
– S C Porter
- 1988
|
|
14
|
Fast decoding of codes from algebraic plane curves
– J. Justesen, K. J. Larsen, H. Elbr$nd Jensen, T. Hdholdt
- 1992
|
|
7
|
Algebraic decoding using special divisors
– I Duursma
- 1993
|
|
80
|
S.G.Vlădut¸, Algebraic-Geometric Codes
– M A Tsfasman
- 1991
|
|
18
|
Algebraic geometric codes
– M A Tsfasman, S G Vlădu¸t
- 1991
|
|
8
|
Tzeng: A New Procedure for Decoding Cyclic and BCH Codes up to Actual Minimum Distance
– G L Feng, K K
- 1994
|
|
11
|
Extension of the Berlekamp–Massey algorithm to N dimensions
– S Sakata
- 1990
|
|
9
|
Finding a minimal set of linear recurring relations capable of generating a given finite two dimensional array
– S Sakata
- 1988
|
|
216
|
Shift-register synthesis and BCH decoding
– J L Massey
- 1969
|
|
9
|
Brigand, “Effective construction of Algebraic Geometry codes
– G Haché, D Le
- 1995
|
|
16
|
Decoding Algebraic-Geometric Codes up to the Designed Minimum Distance
– G-L Feng, T R N Rao
- 1993
|
