Abstract
Summary form only given, as follows. A Reed-Solomon decoder that makes use of bit soft-decision information is presented. A Reed-Solomon generator matrix which possesses a certain inherent structure in GF(2) is derived. This structure enables representation of the code as a union of cosets, each coset being an interleaver of several binary BCH codes. Such partition into cosets provides a clue for efficient bit-level soft-decision decoding. The proposed decoding algorithms are several orders of magnitude more efficient than conventional techniques for many codes.
| Original language | English |
|---|---|
| Pages | 106 |
| Number of pages | 1 |
| State | Published - 1990 |
| Event | 1990 IEEE International Symposium on Information Theory - San Diego, CA, USA Duration: 14 Jan 1990 → 19 Jan 1990 |
Conference
| Conference | 1990 IEEE International Symposium on Information Theory |
|---|---|
| City | San Diego, CA, USA |
| Period | 14/01/90 → 19/01/90 |