Reverse Berlekamp-Massey decoding

Jiun-Hung Yu, Hans Andrea Loeliger

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Scopus citations

Abstract

We propose a new algorithm for decoding Reed-Solomon codes (up to half the minimum distance) and for computing inverses in F[x]/m(x). The proposed algorithm is similar in spirit and structure to the Berlekamp-Massey algorithm, but it works naturally for general m(x).

Original languageEnglish
Title of host publication2013 IEEE International Symposium on Information Theory, ISIT 2013
Pages1212-1216
Number of pages5
DOIs
StatePublished - 19 Dec 2013
Event2013 IEEE International Symposium on Information Theory, ISIT 2013 - Istanbul, Turkey
Duration: 7 Jul 201312 Jul 2013

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
ISSN (Print)2157-8095

Conference

Conference2013 IEEE International Symposium on Information Theory, ISIT 2013
CountryTurkey
CityIstanbul
Period7/07/1312/07/13

Fingerprint Dive into the research topics of 'Reverse Berlekamp-Massey decoding'. Together they form a unique fingerprint.

Cite this