Simplification of Procedure for Decoding Reed-Solomon Codes Using Various Algorithms: An Introductory Survey
- Vivek M Tilavat
- Dr.Yagnesh Shukla
Reed-Solomon codes, Peterson-Gorenstein-Zierler algorithm, and Berlekamp-Massy algorithm.
Reed-Solomon codes are very useful and effective in burst error in noisy environment. In decoding process for 1 error or 2 errors create easily with using procedure of Peterson-Gorenstein –Zierler algorithm. If decoding process for 3 or more errors, these errors can be solved with key equation of a new algorithm named Berlekamp-massey algorithm. In this paper, wide discussion of procedures of Peterson-Gorenstein –Zierler algorithm and Berlekamp-Massey algorithm and show the advantages of modified version of Berlekam-Massey algorithm with its steps.
Vivek M Tilavat, Dr.Yagnesh Shukla. "Simplification of Procedure for Decoding Reed-Solomon Codes Using Various Algorithms: An Introductory Survey".INTERNATIONAL JOURNAL OF ENGINEERING DEVELOPMENT AND RESEARCH ISSN:2321-9939, Vol.2, Issue 1, pp.279-283, URL :https://rjwave.org/ijedr/papers/IJEDR1401047.pdf
Volume 2 Issue 1
Pages. 279-283
