Abstract
An approach to fast soft decoding of some binary codes is presented. The decoding procedure is based on a structure called constrained design and is accelerated by applying certain elimination rules. An improved maximum likelihood soft decoder is designed for the [24, 6, 8] code. This decoder serves as a component for constructing decoders for several codes, including the [24, 12, 8] Golay code, the F24 code and some other codes of length 24. The method is applicable also to the decoding of second order Reed-Muller codes.
| Original language | English |
|---|---|
| State | Published - 1994 |
| Event | Proceedings of the 1994 IEEE International Symposium on Information Theory - Trodheim, Norw Duration: 27 Jun 1994 → 1 Jul 1994 |
Conference
| Conference | Proceedings of the 1994 IEEE International Symposium on Information Theory |
|---|---|
| City | Trodheim, Norw |
| Period | 27/06/94 → 1/07/94 |