Decoding by sequential code reduction
L. Rudolph, Carlos R. P. Hartmann · IEEE Transactions on Information Theory · 1973
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.