Decoding linear error-correcting codes up to half the minimum distance with Gröbner bases

Abstract

In this short note we show how one can decode linear error-correcting codes up to half the minimum distance via solving a system of polynomial equations over a finite field. We also explicitly present the reduced Gröbner basis for the system considered. © 2009 Springer-Verlag Berlin Heidelberg.