Generalized threshold decoding of linear codes
Willis C. Gore · IEEE Transactions on Information Theory · 1969
It is proved that every linear code of dimensionkcan be decoded by a threshold decoding circuit that is guaranteed to correcteerrors ife \leq (d - 1)/2wheredis the minimum distance of the code. Moreover it is demonstrated that the number of levels of threshold logic is less than or equal tokby giving an algorithm for generating the decoding logic employingklevels.