Abstract
Ordinarily a vast population of error patterns is encountered in maximum likelihood soft-decision syndrome decoding of a binary linear block code. An approach is introduced for creating a substantially reduced family of error patterns. Some properties of the members of the reduced class are presented. Substantial computational gain is demonstrated through direct and, to a smaller extent, by coset-decoding implementations based on predetermined lists that specify the error patterns belonging to the reduced family.
Original language | English |
---|---|
Pages (from-to) | 1194-1200 |
Number of pages | 7 |
Journal | IEEE Transactions on Information Theory |
Volume | 37 |
Issue number | 4 |
DOIs | |
State | Published - Jul 1991 |
Keywords
- Soft-syndrome decoding
- binary block codes
- maximum likelihood
- sorting