Memory/speed tradeoffs for look-up table decoding of systematic linear block codes
D. Hertz, Y. Azenkot · IEEE Transactions on Communications · 1990
Memory/speed tradeoffs are presented for the implementation of systematic linear block code decoders using lookup tables. Specifically, the authors show how to reduce the size of the lookup table that converts the syndrome into the error pattern. On the basis of such a single-error-correcting decoder they propose a t-stage decoder that can correct up to t errors. It is shown that the proposed scheme actually constitutes a general method for compressing lookup tables.>