FAST DECODING OF ALGEBRAIC-GEOMETRIC CODES UP TO THE DESIGNED MINIMUMDISTANCE

Authors
SAKATA S JUSTESEN J MADELUNG Y JENSEN HE HOHOLDT T
Citation
S. Sakata et al., FAST DECODING OF ALGEBRAIC-GEOMETRIC CODES UP TO THE DESIGNED MINIMUMDISTANCE, IEEE transactions on information theory, 41(6), 1995, pp. 1672-1677
Citations number
19
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
1672 - 1677
Database
ISI
SICI code
0018-9448(1995)41:6<1672:FDOACU>2.0.ZU;2-P
Abstract
We present a decoding algorithm for algebraic-geometric codes from reg ular plane curves, in particular the Hermitian curve, which corrects a ll error patternes of weight less than 6/2 with low complexity. The a lgorithm is based on the majority scheme of Feng and Rao and uses a mo dified version of Sakata's generalization of the Berlekamp-Massey algo rithm.