.png){kind=icon}
Return
A simplified step-by-step decoding algorithm for parallel decoding of Reed-Solomon codes
.png){kind=icon}
PRE
AI
DOI：10.1109/TCOMM.2007.898703.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
A simplified parallel step-by-step decoding algorithm is proposed for decoding Reed-Solomon (RS) codes. It uses new method to calculate the determinants of the temporarily changed syndrome matrices, based on the property of these matrices determined in this paper. By using the proposed method, the calculations of the determinants of the temporarily changed syndrome matrices become much simpler and thus the computational complexity of the step-by-step decoding algorithm is significantly reduced.
Keywords:
CHAUDHURI-HOCQUENGHEM CODES
BINARY BCH CODES
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
8.3
Papers:
1.2W
Citations:
3.6W
Organization
No organization information available
Cited Papers
.png){kind=icon}
ShareSave
ShareSaveShareSave no more
no more