Fast soft decoding of same binary codes using constrained designs

Moshe Ran, Jakov Snyders

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

An approach to fast soft decoding of some binary block 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 F 2/4 code and some other code of length 24. The method is applicable also to the decoding of second order Reed-Muller codes.

Original languageEnglish
Title of host publicationProceedings - 1994 IEEE International Symposium on Information Theory, ISIT 1994
Pages398
Number of pages1
DOIs
StatePublished - 1994
Event1994 IEEE International Symposium on Information Theory, ISIT 1994 - Trondheim, Norway
Duration: 27 Jun 19941 Jul 1994

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
ISSN (Print)2157-8095

Conference

Conference1994 IEEE International Symposium on Information Theory, ISIT 1994
Country/TerritoryNorway
CityTrondheim
Period27/06/941/07/94

Fingerprint

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

Cite this