Decoding a Class of Affine Variety Codes with Fast DFT

arXiv1210.0083MaRDI QIDQ6236006FDOQ6236006

Publication date: 29 September 2012

Abstract: An efficient procedure for error-value calculations based on fast discrete Fourier transforms (DFT) in conjunction with Berlekamp-Massey-Sakata algorithm for a class of affine variety codes is proposed. Our procedure is achieved by multidimensional DFT and linear recurrence relations from Grobner basis and is applied to erasure-and-error decoding and systematic encoding. The computational complexity of error-value calculations in our algorithm improves that in solving systems of linear equations from error correcting pairs in many cases. A motivating example of our algorithm in case of a Reed-Solomon code and a numerical example of our algorithm in case of a Hermitian code are also described.

This page was built for publication: Decoding a Class of Affine Variety Codes with Fast DFT

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6236006)