On maximum likelihood, soft decision decoding of binary (linear) codes

Patrick A.H. Bours, Niels J.C. Lous, Henk C.A. van Tilborg

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

Abstract

Two efficient, maximum likelihood, soft decision decoding algorithms for binary (linear) codes are derived, and compared to known algorithms. The new algorithms do not use a binary tree for considering the possible error patterns corresponding to the received word and for determining the most likely one, but they use a graph that is designed to make a more efficient use of branching and bounding techniques.

Original languageEnglish
Title of host publicationProceedings - 1991 IEEE International Symposium on Information Theory, ISIT 1991
Place of PublicationPiscataway
PublisherInstitute of Electrical and Electronics Engineers
Pages194
Number of pages1
ISBN (Print)0-7803-0056-4
DOIs
Publication statusPublished - 1 Jan 1991
Event1991 IEEE International Symposium on Information Theory, ISIT 1991 - Budapest, Hungary
Duration: 24 Jun 199128 Jun 1991

Conference

Conference1991 IEEE International Symposium on Information Theory, ISIT 1991
Country/TerritoryHungary
CityBudapest
Period24/06/9128/06/91

Fingerprint

Dive into the research topics of 'On maximum likelihood, soft decision decoding of binary (linear) codes'. Together they form a unique fingerprint.

Cite this