Hardware implementation issues of a BMS decoding approach for AG based codes

Algebraic-geometry (AG) family of codes contains sequences with excellent asymptotic behaviour, but only few pieces of work have treated their hardware implementation. In this paper, we investigate an algorithm for decoding AG codes from the hardware feasibility point of view. We modify the original strategy in order to obtain a new structure more suitable for hardware implementation.