Abstract
Conway and Sloane have developed an efficient approach to the maximum-likelihood decoding of a linear block code based on the partitioning of the code into a subcode and its cosets. This procedure works for certain nonlinear codes as well, and we apply it in this paper to the development of several decoding algorithms for the extended Nordstrom-Robinson code used in conjunction with both BPSK and QPSK modulations. The small operation counts and the highly regular structures of many of these algorithms make them particularly well-suited to VLSI implementation. We describe one such implementation in this paper.
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.
