A fast algorithm for decoding algebraic geometry codes with the displacement rank

This paper deals with how to find a nonzero element efficiently in the kernel of a given structured matrix. By applying the displacement rank of a structured matrix, we propose a fast algorithm for decoding algebraic geometry codes with the computational complexity O(n
²
).