Abstract
A two-stage list decoder for generalized Reed-Solomon codes over GR (p/sup l/,m) that can exceed the Guruswami-Sudan decoding radius t/sub GS/ with significant probability for p=2, l/spl ges/2 and m=1 was recently proposed. It makes a distinction between error values which are units and those which are zero divisors in order to exceed t/sub GS/. This letter presents an extension of that approach by exploiting the fact that each element of GR (p/sup l/,m) has a unique p-adic expansion, culminating in a multistage decoder that outperforms the two-stage decoder.
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.
