Answers are grounded in this paper and cite their sources.
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.>
No takes yet. Share an insight, caveat, or question.
Hertz et al. (1990) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: