4 papers · 1 filter
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…
Bounds for Joint Detection and Decoding on the Binary-Input AWGN Channel
Simon Obermüller, Jannis Clausius, Marvin Geiselhart +1
For asynchronous transmission of short blocks, preambles for packet detection contribute a non-negligible overhead. To reduce the required preamble length, joint detection and deco…
A Comparative Study of Ensemble Decoding Methods for Short Length LDPC Codes
Felix Krieg, Jannis Clausius, Marvin Geiselhart +1
To alleviate the suboptimal performance of belief propagation (BP) decoding of short low-density parity-check (LDPC) codes, a plethora of improved decoding algorithms has been prop…
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…