Name
Title | ||
|---|---|---|
A Future Simplification of Procedure for Decoding Nonsystematic Reed-Solomon Codes Using the Berlekamp-Massey Algorithm. |
Abstract | ||
|---|---|---|
It is well-known that the Euclidean algorithm can be used o find the systematic errata-locator polynomial and the errata-evaluator polynomial simultaneously in Berlekamp's key equation that is needed to decode a Reed-Solomon (RS) codes. In this paper, a simplified decoding algorithm to correct both errors and erasures is used in conjunction with the Euclidean algorithm for efficiently decoding non... |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1109/TCOMM.2011.050211.100170 | IEEE Transactions on Communications |
Keywords | Field | DocType |
Polynomials,Decoding,Transforms,Mathematical model,Reed-Solomon codes,Interpolation | Sequential decoding,Berlekamp–Welch algorithm,Computer science,Euclidean algorithm,Algorithm,Reed–Solomon error correction,Decoding methods,Berlekamp–Massey algorithm,List decoding,Computational complexity theory | Journal |
Volume | Issue | ISSN |
59 | 6 | 0090-6778 |
Citations | PageRank | References |
1 | 0.36 | 12 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Tsung-Ching Lin | 1 | 74 | 14.69 |
| Trieu-Kien Truong | 2 | 382 | 59.00 |
| Hsin-Chiu Chang | 3 | 33 | 7.58 |
| Hung-Peng Lee | 4 | 30 | 5.14 |