1 citations · 4 across the 32 of their papers we have counts for
7 papers · 1 filter
On the Error Rate of Binary BCH Codes under Error-and-erasure Decoding
Sisi Miao, Jonathan Mandelbaum, Holger Jäkel +1
Determining the exact decoding error probability of linear block codes is an interesting problem. For binary BCH codes, McEliece derived methods to estimate the error probability o…
Signal Space-Transformed Expectation Propagation for Symbol Detection in ISI Channels
Jannis Clausius, Luca Schmid, Laurent Schmalen +1
Iterative message passing detection based on expectation propagation (EP) has demonstrated near-optimum performance in many signal processing and communication scenarios. The metho…
High Girth Spatially-Coupled LDPC Codes with Hierarchical Structure
Haizheng Li, Sisi Miao, Laurent Schmalen
Quasi-cyclic (QC) low-density parity-check (LDPC) codes are a class of LDPC codes with a simple construction facilitating hardware implementation while achieving excellent performa…
Protograph-Based LDPC Codes with Local Irregularity
Vincent Wüst, Erdem Eray Cil, Laurent Schmalen
Forward error correcting (FEC) codes are used in many communication standards with a wide range of re quirements. FEC codes should work close to capacity, achieve low error floors,…
Subcode Ensemble Decoding of Polar Codes
Henning Lulei, Jonathan Mandelbaum, Marvin Rübenacke +3
In the short block length regime, pre-transformed polar codes together with successive cancellation list (SCL) decoding possess excellent error correction capabilities. However, in…
Subcode Ensemble Decoding of Linear Block Codes
Jonathan Mandelbaum, Holger Jäkel, Laurent Schmalen
Low-density parity-check (LDPC) codes together with belief propagation (BP) decoding yield exceptional error correction capabilities in the large block length regime. Yet, there re…
Removal of Small Weight Stopping Sets for Asynchronous Unsourced Multiple Access
Frederik Ritter, Jonathan Mandelbaum, Alexander Fengler +2
In this paper, we analyze the formation of small stopping sets in joint factor graphs describing a frame-asynchronous two-user transmission. Furthermore, we propose an algorithm to…