11 citations · 12 across the 9 of their papers we have counts for
9 papers
Chase-like Decoding: Test-Pattern Design and Performance Analysis
Tim Janz, Simon Obermüller, Andreas Zunker +1
Chase-like decoding algorithms are a popular choice for soft-input decoding of algebraic codes. We evaluate different test-pattern sets for Chase-like decoding. Structured sets, su…
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…
Long Polar vs. LDPC Codes under Complexity-Constrained Decoding
Felix Krieg, Marvin Rübenacke, Andreas Zunker +1
The prevailing opinion in industry and academia is that polar codes are competitive for short code lengths, but can no longer keep up with low-density parity-check (LDPC) codes as…
ORCAS Codes: A Flexible Generalization of Polar Codes with Low-Complexity Decoding
Andreas Zunker, Marvin Rübenacke, Stephan ten Brink
Motivated by the need for channel codes with low-complexity soft-decision decoding algorithms, we consider the recursive Plotkin concatenation of optimal low-rate and high-rate cod…
Soft-Output from Covered Space Decoding of Product Codes
Tim Janz, Simon Obermüller, Andreas Zunker +1
In this work, we propose a new soft-input soft-output decoder called soft-output from covered space (SOCS) decoder. It estimates the a posteriori reliability based on the space exp…
Nested Symmetric Polar Codes
Marvin Rübenacke, Andreas Zunker, Felix Krieg +1
In this paper, we propose a data-driven algorithm to design rate- and length-flexible polar codes. While the algorithm is very general, a particularly appealing use case is the des…
Row-Merged Polar Codes: Analysis, Design and Decoder Implementation
Andreas Zunker, Marvin Geiselhart, Lucas Johannsen +4
Row-merged polar codes are a family of pre-transformed polar codes (PTPCs) with little precoding overhead. Providing an improved distance spectrum over plain polar codes, they are…
Enumeration of Minimum Weight Codewords of Pre-Transformed Polar Codes by Tree Intersection
Andreas Zunker, Marvin Geiselhart, Stephan ten Brink
Pre-transformed polar codes (PTPCs) form a class of codes that perform close to the finite-length capacity bounds. The minimum distance and the number of minimum weight codewords a…
Graph Search based Polar Code Design
Marvin Geiselhart, Andreas Zunker, Ahmed Elkelesh +2
It is well known that to fulfill their full potential, the design of polar codes must be tailored to their intended decoding algorithm. While for successive cancellation (SC) decod…