Abstract
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.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
