GENERALIZED BERLEKAMP-MASSEY DECODING OF ALGEBRAIC-GEOMETRIC CODES UPTO HALF THE FENG-RAO BOUND

Authors
SAKATA S JENSEN HE HOHOLDT T
Citation
S. Sakata et al., GENERALIZED BERLEKAMP-MASSEY DECODING OF ALGEBRAIC-GEOMETRIC CODES UPTO HALF THE FENG-RAO BOUND, IEEE transactions on information theory, 41(6), 1995, pp. 1762-1768
Citations number
14
Categorie Soggetti
Information Science & Library Science","Engineering, Eletrical & Electronic
Journal title
IEEE transactions on information theory → ACNP
ISSN journal
00189448
Volume
41
Issue
6
Year of publication
1995
Part
1
Pages
1762 - 1768
Database
ISI
SICI code
0018-9448(1995)41:6<1762:GBDOAC>2.0.ZU;2-K
Abstract
We treat a general class of algebraic-geometric codes and show how to decode these up to half the Feng-Rao bound, using an extension and mod ification of the Sakata algorithm, The Sakata algorithm is a generaliz ation to S dimensions of the classical Berlekamp-Massey algorithm.