Partial ordering of error patterns for maximum likelihood soft decoding

Jakov Snyders*

*Corresponding author for this work

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

Abstract

The error patterns, encountered in maximum likelihood soft decision syndrome decoding of a binary linear block code, can be partially ordered in a way that only the minimal elements have to be scored. The ordering requires a usually short sorting proceedure applied to the confidence values of the hard-detected bits. In this paper some properties of the minimal elements are derived. We also present bounds on the number of minimal elements with particularly large Hamming weight.

Original languageEnglish
Title of host publicationAlgebraic Coding - 1st French-Soviet Workshop, Proceedings
EditorsGerard Cohen, Antoine Lobstein, Gilles Zemor, Simon Litsyn
PublisherSpringer Verlag
Pages120-125
Number of pages6
ISBN (Print)9783540551300
DOIs
StatePublished - 1992
Event1st French-Soviet Workshop on Algebraic Coding, 1991 - Paris, France
Duration: 22 Jul 199124 Jul 1991

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume573 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference1st French-Soviet Workshop on Algebraic Coding, 1991
Country/TerritoryFrance
CityParis
Period22/07/9124/07/91

Fingerprint

Dive into the research topics of 'Partial ordering of error patterns for maximum likelihood soft decoding'. Together they form a unique fingerprint.

Cite this