A general decoding method for linear codes is investigated for cyclic
codes. The decoding consists of solving two systems of linear equation
s. All but four binary cyclic codes of length less than 63 can so be d
ecoded up to their actual distance. A new family of codes is given for
which the decoding needs only O(n2) operations.