A general decoding method for cyclic codes is presented which gives promise of substantially reducing the complexity of decoders at the cost of a modest increase in decoding time (or delay). Significant reductions in decoder complexity for binary cyclic finite-geometry codes are demonstrated, and two decoding options for the Golay code are presented.
Rudolph, Luther D. and Hartmann, Carlos R.P., "Decoding by Sequential Code Reduction" (1972). Electrical Engineering and Computer Science Technical Reports. Paper 10.