Decoding by Sequential Code Reduction

Luther D. Rudolph, Syracuse University
Carlos R.P. Hartmann, Syracuse University



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.