Toggle Main Menu Toggle Search

Open Access padlockePrints

Low-Complexity Chase Decoding of Algebraic-Geometric Codes Using Koetter's Interpolation

Lookup NU author(s): Dr Li Chen, Dr Martin Johnston


Full text for this publication is not currently held within this repository. Alternative links are provided below where available.


Algebraic-geometric (AG) codes have long been considered as a possible candidate to replace Reed-Solomon (RS) codes. However, their decoding remains complex and infeasible to implement. Addressing this challenge, our paper proposes a low-complexity Chase (LCC) decoding algorithm for the most popular class of AG codes - Hermitian codes. The LCC decoding is realised by formulating decoding test-vectors, which allows Koetter's interpolation to be performed for common and uncommon elements. This reduces redundant computations and also removes the need to calculate the corresponding coefficients of a Hermitian curve, thus facilitating message recovery. Our simulation results show that significant coding gains can be achieved over the conventional Koetter-Vardy (KV) soft decoding algorithm, but with a much lower computational cost. Moreover, we also show that in comparison with RS codes of a similar length, Chase decoding has a more significant impact on enhancing the performance of Hermitian codes.

Publication metadata

Author(s): Wu SY, Chen L, Johnston M

Publication type: Conference Proceedings (inc. Abstract)

Publication status: Published

Conference Name: 2016 IEEE Information Theory Workshop (ITW)

Year of Conference: 2016

Online publication date: 27/10/2016

Acceptance date: 02/04/2016

Publisher: IEEE


DOI: 10.1109/ITW.2016.7606867

Library holdings: Search Newcastle University Library for this item

ISBN: 9781509010912