Fast transform decoding of nonsystematic reed-solomon codes | Zendy

Akira Shiozaki | Zendy; TrieuKien Truong | Zendy; K. M. Cheung | Zendy; I.S. Reed | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Fast transform decoding of nonsystematic reed-solomon codes

Author(s) -

Akira Shiozaki,

TrieuKien Truong,

K. M. Cheung,

I.S. Reed

Publication year - 1990

Publication title -

iee proceedings e computers and digital techniques

Language(s) - English

Resource type - Journals

eISSN - 2053-7948

pISSN - 0143-7062

DOI - 10.1049/ip-e.1990.0015

Subject(s) - decoding methods , berlekamp–welch algorithm , list decoding , reed–solomon error correction , sequential decoding , computer science , polynomial code , algorithm , code (set theory) , polynomial , very large scale integration , arithmetic , concatenated error correction code , mathematics , block code , embedded system , mathematical analysis , set (abstract data type) , programming language

By considering a Reed-Solomon (RS) code to be a special case of a redundant residue polynomial code, a fast transform decoding algorithm to correct both errors and erasures is presented. This decoding scheme is an improvement of the decoding algorithm for the redundant residue polynomial code suggested by Shiozaki and Nishida (1975). This decoding scheme can be realised readily on VLSI chips.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research