A FAST PARALLEL IMPLEMENTATION OF A BERLEKAMP-MASSEY ALGORITHM FOR ALGEBRAIC-GEOMETRIC CODES

We obtain a parallel Berlekamp-Massey-type algorithm for determining e rror locating functions for the class of one point algebraic-geometric codes. The proposed algorithm has a regular and simple structure and is suitable for VLSI implementation. We give an outline for an impleme ntation, which uses as main blocks gamma copies of a modified one-dime nsional Berlekamp-Massey algorithm, where gamma is the order of the fi rst nongap in the function space associated with the code. Such a para llel implementation determines the error locator for an algebraic-geom etric code using the same time requirements as the underlying one-dime nsional Berlekamp-Massey algorithm applied to the decoding of Reed-Sol omon codes.