Fast soft decoding of some binary codes using constrained designs

Moshe Ran*, Jakov Snyders

*Corresponding author for this work

Research output: Contribution to conferencePaperpeer-review

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 languageEnglish
StatePublished - 1994
EventProceedings of the 1994 IEEE International Symposium on Information Theory - Trodheim, Norw
Duration: 27 Jun 19941 Jul 1994

Conference

ConferenceProceedings of the 1994 IEEE International Symposium on Information Theory
CityTrodheim, Norw
Period27/06/941/07/94

Fingerprint

Dive into the research topics of 'Fast soft decoding of some binary codes using constrained designs'. Together they form a unique fingerprint.

Cite this