A maximum likelihood polynomial time syndrome decoder to correct linearly independent errors

It is shown for a linear code over F/sub 2/L, defined by a binary parity matrix H, that the minimum weight error vector e associated with a syndrome s can be computed in polynomial time if the nonzero elements of the error vector are linearly independent over F/sub 2/L.