On survivor error patterns for maximum likelihood soft decoding

Jakov Snyders

doi:10.1109/ISIT.1991.695248

On survivor error patterns for maximum likelihood soft decoding

Jakov Snyders^*

^*Corresponding author for this work

Department of Electrical Engineering - Systems

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

2 Scopus citations

Abstract

Ordinarily a large number of error patterns is encountered in maximum likelihood soft decision syndrome decoding of a binary linear block code. However, many of them can be eliminated (without scoring) on the basis of the sorted confidence values of the hard-detected bits. We present some properties that an error pattern should possess in order to survive such elimination procedure. By applying these necessary conditions for survivability the family of error patterns is substantially reducible, and soft decision decoding is facilitated.

Original language	English
Title of host publication	Proceedings - 1991 IEEE International Symposium on Information Theory, ISIT 1991
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	192
Number of pages	1
ISBN (Electronic)	0780300564
DOIs	https://doi.org/10.1109/ISIT.1991.695248
State	Published - 1991
Event	1991 IEEE International Symposium on Information Theory, ISIT 1991 - Budapest, Hungary Duration: 24 Jun 1991 → 28 Jun 1991

Publication series

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

Conference

Conference	1991 IEEE International Symposium on Information Theory, ISIT 1991
Country/Territory	Hungary
City	Budapest
Period	24/06/91 → 28/06/91

Access to Document

10.1109/ISIT.1991.695248

Cite this

@inproceedings{d774e3e4230e41dc98ad1e03aa5cfbc9,

title = "On survivor error patterns for maximum likelihood soft decoding",

abstract = "Ordinarily a large number of error patterns is encountered in maximum likelihood soft decision syndrome decoding of a binary linear block code. However, many of them can be eliminated (without scoring) on the basis of the sorted confidence values of the hard-detected bits. We present some properties that an error pattern should possess in order to survive such elimination procedure. By applying these necessary conditions for survivability the family of error patterns is substantially reducible, and soft decision decoding is facilitated.",

author = "Jakov Snyders",

note = "Publisher Copyright: {\textcopyright} 1991 Institute of Electrical and Electronics Engineers Inc. All rights reserved.; 1991 IEEE International Symposium on Information Theory, ISIT 1991 ; Conference date: 24-06-1991 Through 28-06-1991",

year = "1991",

doi = "10.1109/ISIT.1991.695248",

language = "אנגלית",

series = "IEEE International Symposium on Information Theory - Proceedings",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

pages = "192",

booktitle = "Proceedings - 1991 IEEE International Symposium on Information Theory, ISIT 1991",

address = "ארצות הברית",

}

Snyders, J 1991, On survivor error patterns for maximum likelihood soft decoding. in Proceedings - 1991 IEEE International Symposium on Information Theory, ISIT 1991., 695248, IEEE International Symposium on Information Theory - Proceedings, Institute of Electrical and Electronics Engineers Inc., pp. 192, 1991 IEEE International Symposium on Information Theory, ISIT 1991, Budapest, Hungary, 24/06/91. https://doi.org/10.1109/ISIT.1991.695248

On survivor error patterns for maximum likelihood soft decoding. / Snyders, Jakov.
Proceedings - 1991 IEEE International Symposium on Information Theory, ISIT 1991. Institute of Electrical and Electronics Engineers Inc., 1991. p. 192 695248 (IEEE International Symposium on Information Theory - Proceedings).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - On survivor error patterns for maximum likelihood soft decoding

AU - Snyders, Jakov

PY - 1991

Y1 - 1991

N2 - Ordinarily a large number of error patterns is encountered in maximum likelihood soft decision syndrome decoding of a binary linear block code. However, many of them can be eliminated (without scoring) on the basis of the sorted confidence values of the hard-detected bits. We present some properties that an error pattern should possess in order to survive such elimination procedure. By applying these necessary conditions for survivability the family of error patterns is substantially reducible, and soft decision decoding is facilitated.

AB - Ordinarily a large number of error patterns is encountered in maximum likelihood soft decision syndrome decoding of a binary linear block code. However, many of them can be eliminated (without scoring) on the basis of the sorted confidence values of the hard-detected bits. We present some properties that an error pattern should possess in order to survive such elimination procedure. By applying these necessary conditions for survivability the family of error patterns is substantially reducible, and soft decision decoding is facilitated.

UR - http://www.scopus.com/inward/record.url?scp=0001324122&partnerID=8YFLogxK

U2 - 10.1109/ISIT.1991.695248

DO - 10.1109/ISIT.1991.695248

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:0001324122

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 192

BT - Proceedings - 1991 IEEE International Symposium on Information Theory, ISIT 1991

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 1991 IEEE International Symposium on Information Theory, ISIT 1991

Y2 - 24 June 1991 through 28 June 1991

ER -

On survivor error patterns for maximum likelihood soft decoding

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this