On Maximum Likelihood Soft Decoding of Some Binary Self-Dual Codes

Moshe Ran, Jakov Snyders

Research output: Contribution to journalArticlepeer-review

Abstract

Efficient algorithms are derived for maximum like-lihood soft-decision decoding of some binary self-dual codes, A family of easily decodable self-dual codes is derived by modifying a known [24, 12, 4] codeF24, whose weight distribution resembles the weight distribution of the [24, 12, 8] Golay code G24. The maximum likelihood decoding of F21is accomplished by only 227 real additions, compared to 651 required for G21, yet the error rates of the two decoders are similar for moderate noise conditions.

Original languageEnglish
Pages (from-to)439-443
Number of pages5
JournalIEEE Transactions on Communications
Volume41
Issue number3
DOIs
StatePublished - Mar 1993

Fingerprint

Dive into the research topics of 'On Maximum Likelihood Soft Decoding of Some Binary Self-Dual Codes'. Together they form a unique fingerprint.

Cite this