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

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

doi:10.1109/ISIT.1991.695250

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

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

Mathematics and Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-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 language	English
Title of host publication	Proceedings - 1991 IEEE International Symposium on Information Theory, ISIT 1991
Place of Publication	Piscataway
Publisher	Institute of Electrical and Electronics Engineers
Pages	194
Number of pages	1
ISBN (Print)	0-7803-0056-4
DOIs	https://doi.org/10.1109/ISIT.1991.695250
Publication status	Published - 1 Jan 1991
Event	1991 IEEE International Symposium on Information Theory, ISIT 1991 - Budapest, Hungary Duration: 24 Jun 1991 → 28 Jun 1991

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.695250

Cite this

@inproceedings{523eeff5e9e449b2b54fa1876c70e33c,

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

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.",

author = "Bours, \{Patrick A.H.\} and Lous, \{Niels J.C.\} and \{van Tilborg\}, \{Henk C.A.\}",

year = "1991",

month = jan,

day = "1",

doi = "10.1109/ISIT.1991.695250",

language = "English",

isbn = "0-7803-0056-4",

pages = "194",

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

publisher = "Institute of Electrical and Electronics Engineers",

address = "United States",

note = "1991 IEEE International Symposium on Information Theory, ISIT 1991 ; Conference date: 24-06-1991 Through 28-06-1991",

}

Bours, PAH, Lous, NJC & van Tilborg, HCA 1991, On maximum likelihood, soft decision decoding of binary (linear) codes. in Proceedings - 1991 IEEE International Symposium on Information Theory, ISIT 1991., 695250, Institute of Electrical and Electronics Engineers, Piscataway, pp. 194, 1991 IEEE International Symposium on Information Theory, ISIT 1991, Budapest, Hungary, 24/06/91. https://doi.org/10.1109/ISIT.1991.695250

On maximum likelihood, soft decision decoding of binary (linear) codes. / Bours, Patrick A.H.; Lous, Niels J.C.; van Tilborg, Henk C.A.
Proceedings - 1991 IEEE International Symposium on Information Theory, ISIT 1991. Piscataway: Institute of Electrical and Electronics Engineers, 1991. p. 194 695250.

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

TY - GEN

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

AU - Bours, Patrick A.H.

AU - Lous, Niels J.C.

AU - van Tilborg, Henk C.A.

PY - 1991/1/1

Y1 - 1991/1/1

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/85067432088

U2 - 10.1109/ISIT.1991.695250

DO - 10.1109/ISIT.1991.695250

M3 - Conference contribution

AN - SCOPUS:85067432088

SN - 0-7803-0056-4

SP - 194

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

PB - Institute of Electrical and Electronics Engineers

CY - Piscataway

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

Y2 - 24 June 1991 through 28 June 1991

ER -

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

Abstract

Conference

Access to Document

Other files and links

Fingerprint

Cite this