A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
On complete decoding of linear error-correcting codes
1980
Information and Control
It is shown that minimum distance decoding of linear codes is accomplished by generating all codewords corresponding to all information sets utilizing the corresponding received coordinates. This was previously shown for the special case of maximum distance separable codes. It is shown that for codes over moderate or larger sized fields this method is more effective than that of generating all codewords.
doi:10.1016/s0019-9958(80)90526-4
fatcat:arlrmfchfrbhtf7dcbbtrovoma