This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License
|
||||||||
|
Paper Details
Paper Title
Simplification of Procedure for Decoding Reed-Solomon Codes Using Various Algorithms: An Introductory Survey
Authors
  Vivek M Tilavat,  Dr.Yagnesh Shukla
Abstract
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.
Keywords- Reed-Solomon codes, Peterson-Gorenstein-Zierler algorithm, and Berlekamp-Massy algorithm.
Publication Details
Unique Identification Number - IJEDR1401047Page Number(s) - 279-283Pubished in - Volume 2 | Issue 1 | March 2014DOI (Digital Object Identifier) -    Publisher - IJEDR (ISSN - 2321-9939)
Cite this Article
  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 (IJEDR), ISSN:2321-9939, Volume.2, Issue 1, pp.279-283, March 2014, Available at :http://www.ijedr.org/papers/IJEDR1401047.pdf
Article Preview
|
|
||||||
|