Abstract
The first soft-decision decoding algorithm for algebraic–geometric codes is presented. This algorithm is developed based on the Koetter-Vardy algorithm, which was proposed for the decoding of Reed-Solomon codes. The interpolation process is modified by redefining the zero condition of a trivariate polynomial and introducing complexity reducing methods. Simulation results show that 0.7 and 1.7 dB performance improvements over the hard-decision decoding bound can be achieved in AWGN and quasi-static Rayleigh fading channels, respectively.
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.
