1 citations · 1 across the 14 of their papers we have counts for
13 papers · 1 filter
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…
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…
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…
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…
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…
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…
Improved Generalized Automorphism Belief Propagation Decoding
Jonathan Mandelbaum, Sisi Miao, Nils Albert Schwendemann +2
With the increasing demands on future wireless systems, new design objectives become eminent. Low-density parity-check codes together with belief propagation (BP) decoding have out…
Endomorphisms of Linear Block Codes
Jonathan Mandelbaum, Sisi Miao, Holger Jäkel +1
The automorphism groups of various linear codes are extensively studied yielding insights into the respective code structure. This knowledge is used in, e.g., theoretical analysis…
Performance Analysis of Generalized Product Codes with Irregular Degree Distribution
Sisi Miao, Jonathan Mandelbaum, Lukas Rapp +2
This paper investigates the theoretical analysis of intrinsic message passing decoding for generalized product codes (GPCs) with irregular degree distributions, a generalization of…
A Joint Code and Belief Propagation Decoder Design for Quantum LDPC Codes
Sisi Miao, Jonathan Mandelbaum, Holger Jäkel +1
Quantum low-density parity-check (QLDPC) codes are among the most promising candidates for future quantum error correction schemes. However, a limited number of short to moderate-l…
Generalized Automorphisms of Channel Codes: Properties, Code Design, and a Decoder
Jonathan Mandelbaum, Holger Jäkel, Laurent Schmalen
Low-density parity-check codes together with belief propagation (BP) decoding are known to be well-performing for large block lengths. However, for short block lengths there is sti…