activity
20232026
most citedImproved Generalized Automorphism Belief Propagation Decoding

1 citations · 4 across the 32 of their papers we have counts for

collaborators

33 papers

cs.IT2026

High-Rate Quasi-Dyadic Quantum LDPC Codes

Alessio Baldelli, Sisi Miao, Laurent Schmalen +2

In this work, we propose a novel design of high-rate Calderbank--Shor--Steane (CSS) quantum low-density parity-check (QLDPC) codes based on quasi-dyadic matrices. The Tanner graphs…

cs.IT2026

Low-Complexity Soft-Aided Error-and-Erasure Decoding for Generalized Product Codes

Sisi Miao, Laurent Schmalen

Generalized product codes (GPCs) combine excellent high-rate performance with low-complexity hardware implementations. We propose the refined dynamic reliability score decoder (\ac…

quant-ph2026

Ultra-Low-Rate Information Reconciliation: Repetition Coding or Dedicated Codes?

Erdem Eray Cil, Laurent Schmalen

We compare repetition-based ultra-low-rate information reconciliation with dedicated ultra-low-rate codes for CV-QKD. Repetition coding offers a favorable performance-complexity tr…

eess.SP2026

Modeling and Mitigation of Equalization-Enhanced Phase Noise

Benedikt Geiger, Fred Buchali, Vahid Aref +1

Equalization-enhanced phase noise (EEPN) emerges as a key performance limitation in high symbol-rate coherent transmission systems. In this paper, we highlight recent advances in m…

cs.IT2026

Affine Subcode Ensemble Decoding for Degeneracy-Aware Quantum Error Correction

Leo Wursthorn, Jonathan Mandelbaum, Sisi Miao +4

Quantum low-density parity-check codes are promising candidates for low-overhead fault-tolerant quantum computing, but degeneracy is known to impair the convergence of belief-propa…

cs.IT2026

Improved Chase-Pyndiah Decoding for Product Codes with Scaled Messages

Sisi Miao, Mert Birincioglu, Laurent Schmalen

We propose an enhanced Chase-Pyndiah decoder that scales extrinsic messages based on decoder confidence of the component decoder, achieving a 0.1 dB gain over the original with neg…

cs.IT2026

Affine Subcode Ensemble Decoding of Linear Block Codes

Jonathan Mandelbaum, Paul Bezner, Holger Jäkel +2

In the short block length regime, ensemble decoding schemes with their inherently parallel structure can improve error correction performance and reduce latency compared to stand-a…

cs.IT2026

A Tensor-Train Framework for Bayesian Inference in High-Dimensional Systems: Applications to MIMO Detection and Channel Decoding

Luca Schmid, Dominik Sulz, Shrinivas Chimmalgi +1

Bayesian inference in high-dimensional discrete-input additive noise models is a fundamental challenge in communication systems, as the support of the required joint a posteriori p…

cs.IT2026

Reverse Reconciliation with Soft Information for Discrete-Modulation CV-QKD at Long Range

Marco Origlia, Erdem Eray Cil, Laurent Schmalen +1

We recently introduced a reverse reconciliation scheme with soft information. In this paper, we assess its performance at ultra-low SNR, thus proving that such scheme is a versatil…

cs.IT2026

Towards a Unified Coding Scheme for 6G

Paul Bezner, Erdem Eray Cil, Jannis Clausius +14

The growing demand for higher data rates necessitates continuous innovations in wireless communication systems, particularly with the emergence of 6G. Channel coding plays a crucia…

quant-ph2026

Practical Methods for Distance-Adaptive Continuous-Variable Quantum Key Distribution

Jonas Berl, Utku Akin, Erdem Eray Cil +2

Continuous-variable quantum key distribution (CV-QKD) is a promising quantum-safe alternative to classical asymmetric cryptography that enables two authenticated parties to establi…

cs.IT2026

Quantum CSS LDPC Codes based on Dyadic Matrices for Belief Propagation-based Decoding

Alessio Baldelli, Massimo Battaglioni, Jonathan Mandelbaum +2

Quantum low-density parity-check (QLDPC) codes provide a practical balance between error-correction capability and implementation complexity in quantum error correction (QEC). In t…

cs.IT2025

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…

cs.IT2025

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…

cs.IT2025

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…

cs.IT2025

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,…

cs.IT2025

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…

cs.IT2025

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…

cs.IT2025

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…

eess.SP2024

Spiking Neural Belief Propagation Decoder for LDPC Codes with Small Variable Node Degrees

Alexander von Bank, Eike-Manuel Edelmann, Jonathan Mandelbaum +1

Spiking neural networks (SNNs) promise energy-efficient data processing by imitating the event-based behavior of biological neurons. In previous work, we introduced the enlarge-lik…

eess.SP2024

Spiking Neural Belief Propagation Decoder for Short Block Length LDPC Codes

Alexander von Bank, Eike-Manuel Edelmann, Sisi Miao +2

Spiking neural networks (SNNs) are neural networks that enable energy-efficient signal processing due to their event-based nature. This paper proposes a novel decoding algorithm fo…

cs.IT2024★ 1 cited

List-based Optimization of Proximal Decoding for LDPC Codes

Andreas Tsouchlos, Holger Jäkel, Laurent Schmalen

In this paper, the proximal decoding algorithm is considered within the context of additive white Gaussian noise (AWGN) channels. An analysis of the convergence behavior of the alg…

quant-ph2024

Parameter Optimization of Rate-Adaptive Continuous-Variable Quantum Key Distribution Systems

Erdem Eray Cil, Jonas Berl, Laurent Schmalen

We propose an optimization method for rate-adaptive CV-QKD systems, improving the SKR by up to 15%. A single information reconciliation setup can generate secret keys up to a dista…

cs.IT2024

Optimization of Iterative Blind Detection based on Expectation Maximization and Belief Propagation

Luca Schmid, Tomer Raviv, Nir Shlezinger +1

We study iterative blind symbol detection for block-fading linear inter-symbol interference channels. Based on the factor graph framework, we design a joint channel estimation and…