8 papers
Improved Acceptance Criteria for Speculative Successive Cancellation Decoding of Polar Codes
Marvin Rübenacke, Ryan Seah, Warren J. Gross
Next-generation data-channel applications of polar codes demand decoding algorithms with high throughput and low latency. The recently proposed speculative successive cancellation…
Speculative Successive Cancellation Decoding of Polar Codes
Ryan Seah, Marvin Rübenacke, Marvin Rübenacke +1
Polar codes achieve channel capacity as block length increases, but this asymptotic advantage comes at the cost of decoding speed: the conventional successive cancellation (SC) alg…
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…
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…
Serial Polar Automorphism Ensemble Decoders for Physical Unclonable Functions
Marvin Rübenacke, Sebastian Cammerer, Michael Sullivan +1
Physical unclonable functions (PUFs) involve challenging practical applications of error-correcting codes (ECCs), requiring extremely low failure rates on the order of an…
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…