Low-Complexity Chase Decoding of Reed-Solomon Codes Using Module

The interpolation based algebraic soft decoding yields a high decoding performance for Reed-Solomon (RS) codes with a polynomial-time complexity. Its computationally expensive interpolation can be facilitated using the module structure. The desired Gröbner basis can be achieved by reducing the basis...

Full description

Saved in:

Bibliographic Details
Published in:	IEEE transactions on communications Vol. 68; no. 10; pp. 6012 - 6022
Main Authors:	Xing, Jiongyue, Chen, Li, Bossert, Martin
Format:	Journal Article
Language:	English
Published:	New York IEEE 01.10.2020 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	Algorithms Basis reduction Codes Complexity Complexity theory Cost analysis Decoding Encoding Interpolation low-complexity Chase decoding Mathematical analysis Maximum likelihood decoding Modules Polynomials progressive decoding Reed-Solomon codes Transforms Vectors (mathematics)
ISSN:	0090-6778, 1558-0857
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!