All Publications

Show all

2015

Journal Articles

Salamanca, Luis ; Murillo-Fuentes, Juan ; Olmos, Pablo M; Perez-Cruz, Fernando ; Verdu, Sergio

Approaching the DT Bound Using Linear Codes in the Short Blocklength Regime Journal Article

IEEE Communications Letters, 19 (2), pp. 123–126, 2015, ISSN: 1089-7798.

Abstract | Links | BibTeX | Tags: binary erasure channel, Channel Coding, Complexity theory, finite blocklength regime, LDPC codes, Maximum likelihood decoding, ML decoding, parity check codes, random coding

2014

Journal Articles

Salamanca, Luis ; Murillo-Fuentes, Juan ; Olmos, Pablo M; Perez-Cruz, Fernando ; Verdu, Sergio

Near DT Bound Achieving Linear Codes in the Short Blocklength Regime Journal Article

IEEE Communications Letters, PP (99), pp. 1–1, 2014, ISSN: 1089-7798.

Abstract | Links | BibTeX | Tags: binary erasure channel, Channel Coding, Complexity theory, finite blocklength regime, LDPC codes, Maximum likelihood decoding, ML decoding, parity check codes, random coding

2013

Journal Articles

Salamanca, Luis ; Olmos, Pablo M; Murillo-Fuentes, Juan Jose ; Perez-Cruz, Fernando

Tree Expectation Propagation for ML Decoding of LDPC Codes over the BEC Journal Article

IEEE Transactions on Communications, 61 (2), pp. 465–473, 2013, ISSN: 0090-6778.

Abstract | Links | BibTeX | Tags: approximate inference, Approximation algorithms, Approximation methods, BEC, binary codes, binary erasure channel, code graph, Complexity theory, equivalent complexity, Gaussian elimination method, Gaussian processes, generalized tree-structured expectation propagatio, graphical message-passing procedure, graphical models, LDPC codes, Maximum likelihood decoding, maximum likelihood solution, ML decoding, parity check codes, peeling decoder, tree expectation propagation, tree graph, Tree graphs, tree-structured expectation propagation, tree-structured expectation propagation decoder, trees (mathematics)