By Topic

Soft decoding of algebraic-geometric codes using Koetter-Vardy algorithm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $31
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Chen, L. ; Sch. of Electr., Electron. & Comput. Eng., Newcastle Univ., Newcastle upon Tyne, UK ; Carrasco, R.A.

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.

Published in:

Electronics Letters  (Volume:45 ,  Issue: 25 )