|
Volumn 43, Issue 5, 1997, Pages 1477-1488
|
On acceptance criterion for efficient successive errors-and-erasures decoding of reed-solomon and BCH codes
|
Author keywords
Decoding algorithms; Decoding complexity; Generalized minimum distance decoding; Reed Solomon codes; Soft decisions; Successive errors and erasures decoding
|
Indexed keywords
ALGORITHMS;
BLOCK CODES;
CODING ERRORS;
COMMUNICATION CHANNELS (INFORMATION THEORY);
COMPUTATIONAL COMPLEXITY;
COMPUTER SIMULATION;
FADING (RADIO);
PERFORMANCE;
POLYNOMIALS;
WHITE NOISE;
DECODING ALGORITHMS;
GENERALIZED MINIMUM DISTANCE DECODING;
REED-SOLOMON CODES;
SOFT DECISIONS;
SUCCESSIVE ERRORS AND ERASURES DECODING;
DECODING;
|
EID: 0031234379
PISSN: 00189448
EISSN: None
Source Type: Journal
DOI: 10.1109/18.623146 Document Type: Article |
Times cited : (9)
|
References (9)
|