https://puma.ub.uni-stuttgart.de/tag/CodingPUMA RSS feed for /tag/Coding2026-04-22T12:36:38+02:00https://puma.ub.uni-stuttgart.de/bibtex/2fe228fbcc1b60b513cf7c65a12393e66/mgeiselhartmgeiselhart2026-04-01T17:32:03+02:00coding myown <span data-person-type="author" class="authorEditorList "><span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Felix Krieg" itemprop="url" href="/person/19295378ba0442a3f3d8b88a90c27b114/author/0"><span itemprop="name">F. Krieg</span></a></span>, </span><span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Marvin Rübenacke" itemprop="url" href="/person/19295378ba0442a3f3d8b88a90c27b114/author/1"><span itemprop="name">M. Rübenacke</span></a></span>, </span><span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Andreas Zunker" itemprop="url" href="/person/19295378ba0442a3f3d8b88a90c27b114/author/2"><span itemprop="name">A. Zunker</span></a></span>, </span> and <span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Stephan ten Brink" itemprop="url" href="/person/19295378ba0442a3f3d8b88a90c27b114/author/3"><span itemprop="name">S. ten Brink</span></a></span></span>. </span><span class="additional-entrytype-information">(<em><span>2025<meta content="2025" itemprop="datePublished"/></span></em>)</span>Wed Apr 01 17:32:03 CEST 2026Long Polar vs. LDPC Codes under Complexity-Constrained Decoding2025coding myown https://puma.ub.uni-stuttgart.de/bibtex/2fe228fbcc1b60b513cf7c65a12393e66/inueinue2026-04-01T17:32:03+02:00myown coding <span data-person-type="author" class="authorEditorList "><span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Felix Krieg" itemprop="url" href="/person/19295378ba0442a3f3d8b88a90c27b114/author/0"><span itemprop="name">F. Krieg</span></a></span>, </span><span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Marvin Rübenacke" itemprop="url" href="/person/19295378ba0442a3f3d8b88a90c27b114/author/1"><span itemprop="name">M. Rübenacke</span></a></span>, </span><span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Andreas Zunker" itemprop="url" href="/person/19295378ba0442a3f3d8b88a90c27b114/author/2"><span itemprop="name">A. Zunker</span></a></span>, </span> and <span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Stephan ten Brink" itemprop="url" href="/person/19295378ba0442a3f3d8b88a90c27b114/author/3"><span itemprop="name">S. ten Brink</span></a></span></span>. </span><span class="additional-entrytype-information">(<em><span>2025<meta content="2025" itemprop="datePublished"/></span></em>)</span>Wed Apr 01 17:32:03 CEST 2026Long Polar vs. LDPC Codes under Complexity-Constrained Decoding2025myown coding https://puma.ub.uni-stuttgart.de/bibtex/2b347cef53d46009c937c47fc1fd4a017/mgeiselhartmgeiselhart2026-04-01T17:31:31+02:00coding myown <span data-person-type="author" class="authorEditorList "><span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Andreas Zunker" itemprop="url" href="/person/1c54febda30c5d7535c0e9f3bdcf4bbbc/author/0"><span itemprop="name">A. Zunker</span></a></span>, </span><span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Marvin Rübenacke" itemprop="url" href="/person/1c54febda30c5d7535c0e9f3bdcf4bbbc/author/1"><span itemprop="name">M. Rübenacke</span></a></span>, </span> and <span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Stephan ten Brink" itemprop="url" href="/person/1c54febda30c5d7535c0e9f3bdcf4bbbc/author/2"><span itemprop="name">S. ten Brink</span></a></span></span>. </span><span class="additional-entrytype-information">(<em><span>2025<meta content="2025" itemprop="datePublished"/></span></em>)</span>Wed Apr 01 17:31:31 CEST 2026ORCAS Codes: A Flexible Generalization of Polar Codes with Low-Complexity Decoding2025coding myown https://puma.ub.uni-stuttgart.de/bibtex/2b347cef53d46009c937c47fc1fd4a017/inueinue2026-04-01T17:31:31+02:00myown coding <span data-person-type="author" class="authorEditorList "><span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Andreas Zunker" itemprop="url" href="/person/1c54febda30c5d7535c0e9f3bdcf4bbbc/author/0"><span itemprop="name">A. Zunker</span></a></span>, </span><span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Marvin Rübenacke" itemprop="url" href="/person/1c54febda30c5d7535c0e9f3bdcf4bbbc/author/1"><span itemprop="name">M. Rübenacke</span></a></span>, </span> and <span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Stephan ten Brink" itemprop="url" href="/person/1c54febda30c5d7535c0e9f3bdcf4bbbc/author/2"><span itemprop="name">S. ten Brink</span></a></span></span>. </span><span class="additional-entrytype-information">(<em><span>2025<meta content="2025" itemprop="datePublished"/></span></em>)</span>Wed Apr 01 17:31:31 CEST 2026ORCAS Codes: A Flexible Generalization of Polar Codes with Low-Complexity Decoding2025myown coding https://puma.ub.uni-stuttgart.de/bibtex/2fa4450c2befc7805899952c3f621e562/mgeiselhartmgeiselhart2026-04-01T17:30:44+02:00coding myown <span data-person-type="author" class="authorEditorList "><span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Paul Bezner" itemprop="url" href="/person/15e78c17ef7291e72ab22ba879cf2de93/author/0"><span itemprop="name">P. Bezner</span></a></span>, </span><span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Erdem Eray Cil" itemprop="url" href="/person/15e78c17ef7291e72ab22ba879cf2de93/author/1"><span itemprop="name">E. Cil</span></a></span>, </span><span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Jannis Clausius" itemprop="url" href="/person/15e78c17ef7291e72ab22ba879cf2de93/author/2"><span itemprop="name">J. Clausius</span></a></span>, </span><span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Oliver Griebel" itemprop="url" href="/person/15e78c17ef7291e72ab22ba879cf2de93/author/3"><span itemprop="name">O. Griebel</span></a></span>, </span><span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Tim Janz" itemprop="url" href="/person/15e78c17ef7291e72ab22ba879cf2de93/author/4"><span itemprop="name">T. Janz</span></a></span>, </span><span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Lucas Johannsen" itemprop="url" href="/person/15e78c17ef7291e72ab22ba879cf2de93/author/5"><span itemprop="name">L. Johannsen</span></a></span>, </span><span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Claus Kestel" itemprop="url" href="/person/15e78c17ef7291e72ab22ba879cf2de93/author/6"><span itemprop="name">C. Kestel</span></a></span>, </span><span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Felix Krieg" itemprop="url" href="/person/15e78c17ef7291e72ab22ba879cf2de93/author/7"><span itemprop="name">F. Krieg</span></a></span>, </span><span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Haizheng Li" itemprop="url" href="/person/15e78c17ef7291e72ab22ba879cf2de93/author/8"><span itemprop="name">H. Li</span></a></span>, </span><span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Jonathan Mandelbaum" itemprop="url" href="/person/15e78c17ef7291e72ab22ba879cf2de93/author/9"><span itemprop="name">J. Mandelbaum</span></a></span></span> and 7 other author(s). </span><span class="additional-entrytype-information">(<em><span>2026<meta content="2026" itemprop="datePublished"/></span></em>)</span>Wed Apr 01 17:30:44 CEST 2026Towards a Unified Coding Scheme for 6G2026coding myown https://puma.ub.uni-stuttgart.de/bibtex/2fa4450c2befc7805899952c3f621e562/inueinue2026-04-01T17:30:44+02:00myown coding <span data-person-type="author" class="authorEditorList "><span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Paul Bezner" itemprop="url" href="/person/15e78c17ef7291e72ab22ba879cf2de93/author/0"><span itemprop="name">P. Bezner</span></a></span>, </span><span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Erdem Eray Cil" itemprop="url" href="/person/15e78c17ef7291e72ab22ba879cf2de93/author/1"><span itemprop="name">E. Cil</span></a></span>, </span><span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Jannis Clausius" itemprop="url" href="/person/15e78c17ef7291e72ab22ba879cf2de93/author/2"><span itemprop="name">J. Clausius</span></a></span>, </span><span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Oliver Griebel" itemprop="url" href="/person/15e78c17ef7291e72ab22ba879cf2de93/author/3"><span itemprop="name">O. Griebel</span></a></span>, </span><span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Tim Janz" itemprop="url" href="/person/15e78c17ef7291e72ab22ba879cf2de93/author/4"><span itemprop="name">T. Janz</span></a></span>, </span><span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Lucas Johannsen" itemprop="url" href="/person/15e78c17ef7291e72ab22ba879cf2de93/author/5"><span itemprop="name">L. Johannsen</span></a></span>, </span><span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Claus Kestel" itemprop="url" href="/person/15e78c17ef7291e72ab22ba879cf2de93/author/6"><span itemprop="name">C. Kestel</span></a></span>, </span><span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Felix Krieg" itemprop="url" href="/person/15e78c17ef7291e72ab22ba879cf2de93/author/7"><span itemprop="name">F. Krieg</span></a></span>, </span><span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Haizheng Li" itemprop="url" href="/person/15e78c17ef7291e72ab22ba879cf2de93/author/8"><span itemprop="name">H. Li</span></a></span>, </span><span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Jonathan Mandelbaum" itemprop="url" href="/person/15e78c17ef7291e72ab22ba879cf2de93/author/9"><span itemprop="name">J. Mandelbaum</span></a></span></span> and 7 other author(s). </span><span class="additional-entrytype-information">(<em><span>2026<meta content="2026" itemprop="datePublished"/></span></em>)</span>Wed Apr 01 17:30:44 CEST 2026Towards a Unified Coding Scheme for 6G2026myown coding https://puma.ub.uni-stuttgart.de/bibtex/2a1ef607da32435185c9c69863e5e3e50/mgeiselhartmgeiselhart2026-04-01T17:29:05+02:00coding myown <span data-person-type="author" class="authorEditorList "><span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Marvin Rübenacke" itemprop="url" href="/person/1e2e2f42868688f1c2ebaf648d1d77224/author/0"><span itemprop="name">M. Rübenacke</span></a></span>, </span><span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Andreas Zunker" itemprop="url" href="/person/1e2e2f42868688f1c2ebaf648d1d77224/author/1"><span itemprop="name">A. Zunker</span></a></span>, </span><span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Felix Krieg" itemprop="url" href="/person/1e2e2f42868688f1c2ebaf648d1d77224/author/2"><span itemprop="name">F. Krieg</span></a></span>, </span> and <span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Stephan ten Brink" itemprop="url" href="/person/1e2e2f42868688f1c2ebaf648d1d77224/author/3"><span itemprop="name">S. Brink</span></a></span></span>. </span><span class="additional-entrytype-information"><span itemtype="http://schema.org/Book" itemscope="itemscope" itemprop="isPartOf"><em><span itemprop="name">ICC 2025 - IEEE International Conference on Communications</span>, </em></span><em>page <span itemprop="pagination">01-06</span>. </em>(<em><span>June 2025<meta content="June 2025" itemprop="datePublished"/></span></em>)</span>Wed Apr 01 17:29:05 CEST 2026ICC 2025 - IEEE International Conference on CommunicationsJune01-06Nested Symmetric Polar Codes2025coding myown 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 design of codes for automorphism ensemble decoding (AED), a promising decoding algorithm for ultra-reliable low-latency communications (URLLC) and massive machine-type communications (mMTC) applications. To this end, theoretic results on nesting of symmetric polar codes are derived, which give hope in finding a fully nested, rate-compatible sequence suitable for AED. Using the proposed algorithms, such a flexible polar code design for automorphism ensemble successive cancellation (SC) decoding is constructed, outperforming existing code designs for AED and also the 5G polar code under cyclic redundancy check (CRC)aided successive cancellation list (SCL) decoding.https://puma.ub.uni-stuttgart.de/bibtex/2a1ef607da32435185c9c69863e5e3e50/inueinue2026-04-01T17:29:05+02:00myown coding <span data-person-type="author" class="authorEditorList "><span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Marvin Rübenacke" itemprop="url" href="/person/1e2e2f42868688f1c2ebaf648d1d77224/author/0"><span itemprop="name">M. Rübenacke</span></a></span>, </span><span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Andreas Zunker" itemprop="url" href="/person/1e2e2f42868688f1c2ebaf648d1d77224/author/1"><span itemprop="name">A. Zunker</span></a></span>, </span><span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Felix Krieg" itemprop="url" href="/person/1e2e2f42868688f1c2ebaf648d1d77224/author/2"><span itemprop="name">F. Krieg</span></a></span>, </span> and <span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Stephan ten Brink" itemprop="url" href="/person/1e2e2f42868688f1c2ebaf648d1d77224/author/3"><span itemprop="name">S. Brink</span></a></span></span>. </span><span class="additional-entrytype-information"><span itemtype="http://schema.org/Book" itemscope="itemscope" itemprop="isPartOf"><em><span itemprop="name">ICC 2025 - IEEE International Conference on Communications</span>, </em></span><em>page <span itemprop="pagination">01-06</span>. </em>(<em><span>June 2025<meta content="June 2025" itemprop="datePublished"/></span></em>)</span>Wed Apr 01 17:29:05 CEST 2026ICC 2025 - IEEE International Conference on CommunicationsJune01-06Nested Symmetric Polar Codes2025myown coding 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 design of codes for automorphism ensemble decoding (AED), a promising decoding algorithm for ultra-reliable low-latency communications (URLLC) and massive machine-type communications (mMTC) applications. To this end, theoretic results on nesting of symmetric polar codes are derived, which give hope in finding a fully nested, rate-compatible sequence suitable for AED. Using the proposed algorithms, such a flexible polar code design for automorphism ensemble successive cancellation (SC) decoding is constructed, outperforming existing code designs for AED and also the 5G polar code under cyclic redundancy check (CRC)aided successive cancellation list (SCL) decoding.https://puma.ub.uni-stuttgart.de/bibtex/2cc6415dce4fd5d85fc76dd0a43a7adb8/mgeiselhartmgeiselhart2026-04-01T17:28:07+02:00coding myown <span data-person-type="author" class="authorEditorList "><span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Henning Lulei" itemprop="url" href="/person/17809721d9866d79c74434b6332498e46/author/0"><span itemprop="name">H. Lulei</span></a></span>, </span><span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Jonathan Mandelbaum" itemprop="url" href="/person/17809721d9866d79c74434b6332498e46/author/1"><span itemprop="name">J. Mandelbaum</span></a></span>, </span><span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Marvin Rübenacke" itemprop="url" href="/person/17809721d9866d79c74434b6332498e46/author/2"><span itemprop="name">M. Rübenacke</span></a></span>, </span><span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Holger Jäkel" itemprop="url" href="/person/17809721d9866d79c74434b6332498e46/author/3"><span itemprop="name">H. Jäkel</span></a></span>, </span><span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Stephan Ten Brink" itemprop="url" href="/person/17809721d9866d79c74434b6332498e46/author/4"><span itemprop="name">S. Ten Brink</span></a></span>, </span> and <span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Laurent Schmalen" itemprop="url" href="/person/17809721d9866d79c74434b6332498e46/author/5"><span itemprop="name">L. Schmalen</span></a></span></span>. </span><span class="additional-entrytype-information"><span itemtype="http://schema.org/Book" itemscope="itemscope" itemprop="isPartOf"><em><span itemprop="name">2025 13th International Symposium on Topics in Coding (ISTC)</span>, </em></span><em>page <span itemprop="pagination">1-5</span>. </em>(<em><span>August 2025<meta content="August 2025" itemprop="datePublished"/></span></em>)</span>Wed Apr 01 17:28:07 CEST 20262025 13th International Symposium on Topics in Coding (ISTC)aug1-5Subcode Ensemble Decoding of Polar Codes2025coding myown In the short block length regime, pre-transformed polar codes together with successive cancellation list (SCL) decoding possess excellent error correction capabilities. However, in practice, the list size is limited due to the suboptimal scaling of the required area in hardware implementations. Automorphism ensemble decoding (AED) can improve performance for a fixed list size by running multiple parallel SCL decodings on permuted received words, yielding a list of estimates from which the final estimate is selected. Yet, AED is limited to appropriately designed polar codes. Subcode ensemble decoding (ScED) was recently proposed for low-density parity-check codes and does not impose such design constraints. It uses multiple decodings in different subcodes, ensuring that the selected subcodes jointly cover the original code. We extend ScED to polar codes by expressing polar subcodes through suitable pre-transformations (PTs). To this end, we describe a framework classifying pre-transformations for pretransformed polar codes based on their role in encoding and decoding. Within this framework, we propose a new type of PT enabling ScED for polar codes, analyze its properties, and discuss how to construct an efficient ensemble.https://puma.ub.uni-stuttgart.de/bibtex/2cc6415dce4fd5d85fc76dd0a43a7adb8/inueinue2026-04-01T17:28:07+02:00myown coding <span data-person-type="author" class="authorEditorList "><span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Henning Lulei" itemprop="url" href="/person/17809721d9866d79c74434b6332498e46/author/0"><span itemprop="name">H. Lulei</span></a></span>, </span><span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Jonathan Mandelbaum" itemprop="url" href="/person/17809721d9866d79c74434b6332498e46/author/1"><span itemprop="name">J. Mandelbaum</span></a></span>, </span><span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Marvin Rübenacke" itemprop="url" href="/person/17809721d9866d79c74434b6332498e46/author/2"><span itemprop="name">M. Rübenacke</span></a></span>, </span><span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Holger Jäkel" itemprop="url" href="/person/17809721d9866d79c74434b6332498e46/author/3"><span itemprop="name">H. Jäkel</span></a></span>, </span><span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Stephan Ten Brink" itemprop="url" href="/person/17809721d9866d79c74434b6332498e46/author/4"><span itemprop="name">S. Ten Brink</span></a></span>, </span> and <span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Laurent Schmalen" itemprop="url" href="/person/17809721d9866d79c74434b6332498e46/author/5"><span itemprop="name">L. Schmalen</span></a></span></span>. </span><span class="additional-entrytype-information"><span itemtype="http://schema.org/Book" itemscope="itemscope" itemprop="isPartOf"><em><span itemprop="name">2025 13th International Symposium on Topics in Coding (ISTC)</span>, </em></span><em>page <span itemprop="pagination">1-5</span>. </em>(<em><span>August 2025<meta content="August 2025" itemprop="datePublished"/></span></em>)</span>Wed Apr 01 17:28:07 CEST 20262025 13th International Symposium on Topics in Coding (ISTC)aug1-5Subcode Ensemble Decoding of Polar Codes2025myown coding In the short block length regime, pre-transformed polar codes together with successive cancellation list (SCL) decoding possess excellent error correction capabilities. However, in practice, the list size is limited due to the suboptimal scaling of the required area in hardware implementations. Automorphism ensemble decoding (AED) can improve performance for a fixed list size by running multiple parallel SCL decodings on permuted received words, yielding a list of estimates from which the final estimate is selected. Yet, AED is limited to appropriately designed polar codes. Subcode ensemble decoding (ScED) was recently proposed for low-density parity-check codes and does not impose such design constraints. It uses multiple decodings in different subcodes, ensuring that the selected subcodes jointly cover the original code. We extend ScED to polar codes by expressing polar subcodes through suitable pre-transformations (PTs). To this end, we describe a framework classifying pre-transformations for pretransformed polar codes based on their role in encoding and decoding. Within this framework, we propose a new type of PT enabling ScED for polar codes, analyze its properties, and discuss how to construct an efficient ensemble.https://puma.ub.uni-stuttgart.de/bibtex/2d1a9cd3e4b7ea292d45c0705f3a2cd42/mgeiselhartmgeiselhart2025-05-06T13:56:07+02:00coding myown <span data-person-type="author" class="authorEditorList "><span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Simon Obermüller" itemprop="url" href="/person/1d3e1e4f4b3211c4f967bc51d8df83eef/author/0"><span itemprop="name">S. Obermüller</span></a></span>, </span><span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Jannis Clausius" itemprop="url" href="/person/1d3e1e4f4b3211c4f967bc51d8df83eef/author/1"><span itemprop="name">J. Clausius</span></a></span>, </span><span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Marvin Geiselhart" itemprop="url" href="/person/1d3e1e4f4b3211c4f967bc51d8df83eef/author/2"><span itemprop="name">M. Geiselhart</span></a></span>, </span> and <span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Stephan ten Brink" itemprop="url" href="/person/1d3e1e4f4b3211c4f967bc51d8df83eef/author/3"><span itemprop="name">S. ten Brink</span></a></span></span>. </span><span class="additional-entrytype-information"><span itemtype="http://schema.org/PublicationIssue" itemscope="itemscope" itemprop="isPartOf"> </span>(<em><span>2025<meta content="2025" itemprop="datePublished"/></span></em>)</span>Tue May 06 13:56:07 CEST 2025Bounds for Joint Detection and Decoding on the Binary-Input AWGN Channel2025coding myown [2409.01119] Bounds for Joint Detection and Decoding on the Binary-Input AWGN Channelhttps://puma.ub.uni-stuttgart.de/bibtex/2d1a9cd3e4b7ea292d45c0705f3a2cd42/inueinue2025-05-06T13:56:07+02:00myown coding <span data-person-type="author" class="authorEditorList "><span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Simon Obermüller" itemprop="url" href="/person/1d3e1e4f4b3211c4f967bc51d8df83eef/author/0"><span itemprop="name">S. Obermüller</span></a></span>, </span><span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Jannis Clausius" itemprop="url" href="/person/1d3e1e4f4b3211c4f967bc51d8df83eef/author/1"><span itemprop="name">J. Clausius</span></a></span>, </span><span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Marvin Geiselhart" itemprop="url" href="/person/1d3e1e4f4b3211c4f967bc51d8df83eef/author/2"><span itemprop="name">M. Geiselhart</span></a></span>, </span> and <span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Stephan ten Brink" itemprop="url" href="/person/1d3e1e4f4b3211c4f967bc51d8df83eef/author/3"><span itemprop="name">S. ten Brink</span></a></span></span>. </span><span class="additional-entrytype-information"><span itemtype="http://schema.org/PublicationIssue" itemscope="itemscope" itemprop="isPartOf"> </span>(<em><span>2025<meta content="2025" itemprop="datePublished"/></span></em>)</span>Tue May 06 13:56:07 CEST 2025Bounds for Joint Detection and Decoding on the Binary-Input AWGN Channel2025myown coding [2409.01119] Bounds for Joint Detection and Decoding on the Binary-Input AWGN Channelhttps://puma.ub.uni-stuttgart.de/bibtex/2f8593f8e84508f87b4e0b31d7188a1bc/mgeiselhartmgeiselhart2025-05-06T13:54:44+02:00coding myown <span data-person-type="author" class="authorEditorList "><span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Sisi Miao" itemprop="url" href="/person/11f94fd8c86f785ad6813d931d681dd81/author/0"><span itemprop="name">S. Miao</span></a></span>, </span><span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Claus Kestel" itemprop="url" href="/person/11f94fd8c86f785ad6813d931d681dd81/author/1"><span itemprop="name">C. Kestel</span></a></span>, </span><span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Lucas Johannsen" itemprop="url" href="/person/11f94fd8c86f785ad6813d931d681dd81/author/2"><span itemprop="name">L. Johannsen</span></a></span>, </span><span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Marvin Geiselhart" itemprop="url" href="/person/11f94fd8c86f785ad6813d931d681dd81/author/3"><span itemprop="name">M. Geiselhart</span></a></span>, </span><span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Laurent Schmalen" itemprop="url" href="/person/11f94fd8c86f785ad6813d931d681dd81/author/4"><span itemprop="name">L. Schmalen</span></a></span>, </span><span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Alexios Balatsoukas-Stimming" itemprop="url" href="/person/11f94fd8c86f785ad6813d931d681dd81/author/5"><span itemprop="name">A. Balatsoukas-Stimming</span></a></span>, </span><span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Gianluigi Liva" itemprop="url" href="/person/11f94fd8c86f785ad6813d931d681dd81/author/6"><span itemprop="name">G. Liva</span></a></span>, </span><span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Norbert Wehn" itemprop="url" href="/person/11f94fd8c86f785ad6813d931d681dd81/author/7"><span itemprop="name">N. Wehn</span></a></span>, </span> and <span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Stephan ten Brink" itemprop="url" href="/person/11f94fd8c86f785ad6813d931d681dd81/author/8"><span itemprop="name">S. ten Brink</span></a></span></span>. </span><span class="additional-entrytype-information"><span itemtype="http://schema.org/PublicationIssue" itemscope="itemscope" itemprop="isPartOf"><em><span itemprop="journal">Proceedings of the IEEE</span>, </em> <em><span itemtype="http://schema.org/PublicationVolume" itemscope="itemscope" itemprop="isPartOf"><span itemprop="volumeNumber">112 </span></span>(<span itemprop="issueNumber">7</span>): <span itemprop="pagination">653-675</span></em> </span>(<em><span>July 2024<meta content="July 2024" itemprop="datePublished"/></span></em>)</span>Tue May 06 13:54:44 CEST 2025Proceedings of the IEEEJuly7653-675Trends in Channel Coding for 6G1122024coding myown Error correction coding (i.e., channel coding) is a key ingredient of any digital communications system. In mobile wireless communications, channel codes have evolved from simple convolutional codes in Global System for Mobile Communications (GSM) (2G), parallel concatenated (turbo) codes in Universal Mobile Telecommunications Service (UMTS) (3G), and long-term evolution (LTE) (4G), to carefully designed multirate/multilength low-density parity-check (LDPC) codes in 5G, combined with polar codes for short messages on the synchronization channel. Based on this rich history, and by accounting for the technological advances in very large-scale integration, this article will outline some recent trends in channel coding as they may be applied in 6G systems, ranging from novel approaches for short blocklengths such as automorphism ensemble decoding, via ideas of coding for multiple access, to concepts for unified coding schemes that may simplify encoding/decoding hardware at competitive error-correcting performance.Trends in Channel Coding for 6G | IEEE Journals & Magazine | IEEE Xplorehttps://puma.ub.uni-stuttgart.de/bibtex/2f8593f8e84508f87b4e0b31d7188a1bc/inueinue2025-05-06T13:54:44+02:00myown coding <span data-person-type="author" class="authorEditorList "><span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Sisi Miao" itemprop="url" href="/person/11f94fd8c86f785ad6813d931d681dd81/author/0"><span itemprop="name">S. Miao</span></a></span>, </span><span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Claus Kestel" itemprop="url" href="/person/11f94fd8c86f785ad6813d931d681dd81/author/1"><span itemprop="name">C. Kestel</span></a></span>, </span><span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Lucas Johannsen" itemprop="url" href="/person/11f94fd8c86f785ad6813d931d681dd81/author/2"><span itemprop="name">L. Johannsen</span></a></span>, </span><span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Marvin Geiselhart" itemprop="url" href="/person/11f94fd8c86f785ad6813d931d681dd81/author/3"><span itemprop="name">M. Geiselhart</span></a></span>, </span><span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Laurent Schmalen" itemprop="url" href="/person/11f94fd8c86f785ad6813d931d681dd81/author/4"><span itemprop="name">L. Schmalen</span></a></span>, </span><span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Alexios Balatsoukas-Stimming" itemprop="url" href="/person/11f94fd8c86f785ad6813d931d681dd81/author/5"><span itemprop="name">A. Balatsoukas-Stimming</span></a></span>, </span><span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Gianluigi Liva" itemprop="url" href="/person/11f94fd8c86f785ad6813d931d681dd81/author/6"><span itemprop="name">G. Liva</span></a></span>, </span><span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Norbert Wehn" itemprop="url" href="/person/11f94fd8c86f785ad6813d931d681dd81/author/7"><span itemprop="name">N. Wehn</span></a></span>, </span> and <span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Stephan ten Brink" itemprop="url" href="/person/11f94fd8c86f785ad6813d931d681dd81/author/8"><span itemprop="name">S. ten Brink</span></a></span></span>. </span><span class="additional-entrytype-information"><span itemtype="http://schema.org/PublicationIssue" itemscope="itemscope" itemprop="isPartOf"><em><span itemprop="journal">Proceedings of the IEEE</span>, </em> <em><span itemtype="http://schema.org/PublicationVolume" itemscope="itemscope" itemprop="isPartOf"><span itemprop="volumeNumber">112 </span></span>(<span itemprop="issueNumber">7</span>): <span itemprop="pagination">653-675</span></em> </span>(<em><span>July 2024<meta content="July 2024" itemprop="datePublished"/></span></em>)</span>Tue May 06 13:54:44 CEST 2025Proceedings of the IEEEJuly7653-675Trends in Channel Coding for 6G1122024myown coding Error correction coding (i.e., channel coding) is a key ingredient of any digital communications system. In mobile wireless communications, channel codes have evolved from simple convolutional codes in Global System for Mobile Communications (GSM) (2G), parallel concatenated (turbo) codes in Universal Mobile Telecommunications Service (UMTS) (3G), and long-term evolution (LTE) (4G), to carefully designed multirate/multilength low-density parity-check (LDPC) codes in 5G, combined with polar codes for short messages on the synchronization channel. Based on this rich history, and by accounting for the technological advances in very large-scale integration, this article will outline some recent trends in channel coding as they may be applied in 6G systems, ranging from novel approaches for short blocklengths such as automorphism ensemble decoding, via ideas of coding for multiple access, to concepts for unified coding schemes that may simplify encoding/decoding hardware at competitive error-correcting performance.Trends in Channel Coding for 6G | IEEE Journals & Magazine | IEEE Xplorehttps://puma.ub.uni-stuttgart.de/bibtex/2ae723295e9ffcc9596d5a938a450da85/inueinue2025-05-06T13:53:09+02:00myown coding <span data-person-type="author" class="authorEditorList "><span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Felix Krieg" itemprop="url" href="/person/137880ae95bb60a15d70bd7cb9d3a85d0/author/0"><span itemprop="name">F. Krieg</span></a></span>, </span><span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Jannis Clausius" itemprop="url" href="/person/137880ae95bb60a15d70bd7cb9d3a85d0/author/1"><span itemprop="name">J. Clausius</span></a></span>, </span><span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Marvin Rübenacke" itemprop="url" href="/person/137880ae95bb60a15d70bd7cb9d3a85d0/author/2"><span itemprop="name">M. Rübenacke</span></a></span>, </span> and <span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Stephan ten Brink" itemprop="url" href="/person/137880ae95bb60a15d70bd7cb9d3a85d0/author/3"><span itemprop="name">S. ten Brink</span></a></span></span>. </span><span class="additional-entrytype-information"><span itemtype="http://schema.org/Book" itemscope="itemscope" itemprop="isPartOf"><em><span itemprop="name">2025 14th International ITG Conference on Systems, Communications and Coding (SCC)</span>, </em></span><em>page <span itemprop="pagination">1-6</span>. </em>(<em><span>March 2025<meta content="March 2025" itemprop="datePublished"/></span></em>)</span>Tue May 06 13:53:09 CEST 20252025 14th International ITG Conference on Systems, Communications and Coding (SCC)March1-6A Comparative Study of Ensemble Decoding Methods for Short Length LDPC Codes2025myown coding 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 proposed over the last two decades. Many of these methods can be described using the same general framework, which we call ensemble decoding: A set of independent constituent decoders works in parallel on the received sequence, each proposing a code-word candidate. From this list, the maximum likelihood (ML) decision is designated as the decoder output. In this paper, we qualitatively and quantitatively compare different realizations of the ensemble decoder, namely multiple-bases belief propagation (MBBP), automorphism ensemble decoding (AED), scheduling ensemble decoding (SED), noise-aided ensemble decoding (NED) and saturated belief propagation (SBP). While all algorithms can provide gains over traditional BP decoding, ensemble methods that exploit the code structure, such as MBBP and AED, typically show greater performance improvements.A Comparative Study of Ensemble Decoding Methods for Short Length LDPC Codes | IEEE Conference Publication | IEEE Xplorehttps://puma.ub.uni-stuttgart.de/bibtex/2ae723295e9ffcc9596d5a938a450da85/mgeiselhartmgeiselhart2025-05-06T13:53:08+02:00coding myown <span data-person-type="author" class="authorEditorList "><span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Felix Krieg" itemprop="url" href="/person/137880ae95bb60a15d70bd7cb9d3a85d0/author/0"><span itemprop="name">F. Krieg</span></a></span>, </span><span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Jannis Clausius" itemprop="url" href="/person/137880ae95bb60a15d70bd7cb9d3a85d0/author/1"><span itemprop="name">J. Clausius</span></a></span>, </span><span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Marvin Rübenacke" itemprop="url" href="/person/137880ae95bb60a15d70bd7cb9d3a85d0/author/2"><span itemprop="name">M. Rübenacke</span></a></span>, </span> and <span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Stephan ten Brink" itemprop="url" href="/person/137880ae95bb60a15d70bd7cb9d3a85d0/author/3"><span itemprop="name">S. ten Brink</span></a></span></span>. </span><span class="additional-entrytype-information"><span itemtype="http://schema.org/Book" itemscope="itemscope" itemprop="isPartOf"><em><span itemprop="name">2025 14th International ITG Conference on Systems, Communications and Coding (SCC)</span>, </em></span><em>page <span itemprop="pagination">1-6</span>. </em>(<em><span>March 2025<meta content="March 2025" itemprop="datePublished"/></span></em>)</span>Tue May 06 13:53:08 CEST 20252025 14th International ITG Conference on Systems, Communications and Coding (SCC)March1-6A Comparative Study of Ensemble Decoding Methods for Short Length LDPC Codes2025coding myown 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 proposed over the last two decades. Many of these methods can be described using the same general framework, which we call ensemble decoding: A set of independent constituent decoders works in parallel on the received sequence, each proposing a code-word candidate. From this list, the maximum likelihood (ML) decision is designated as the decoder output. In this paper, we qualitatively and quantitatively compare different realizations of the ensemble decoder, namely multiple-bases belief propagation (MBBP), automorphism ensemble decoding (AED), scheduling ensemble decoding (SED), noise-aided ensemble decoding (NED) and saturated belief propagation (SBP). While all algorithms can provide gains over traditional BP decoding, ensemble methods that exploit the code structure, such as MBBP and AED, typically show greater performance improvements.A Comparative Study of Ensemble Decoding Methods for Short Length LDPC Codes | IEEE Conference Publication | IEEE Xplorehttps://puma.ub.uni-stuttgart.de/bibtex/2431a23b580b6f34091d0c209bf2168db/mgeiselhartmgeiselhart2025-05-06T13:51:09+02:00coding myown <span data-person-type="author" class="authorEditorList "><span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Andreas Zunker" itemprop="url" href="/person/19a67c8ffc810af63096c674f85ed70ad/author/0"><span itemprop="name">A. Zunker</span></a></span>, </span><span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Marvin Geiselhart" itemprop="url" href="/person/19a67c8ffc810af63096c674f85ed70ad/author/1"><span itemprop="name">M. Geiselhart</span></a></span>, </span><span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Lucas Johannsen" itemprop="url" href="/person/19a67c8ffc810af63096c674f85ed70ad/author/2"><span itemprop="name">L. Johannsen</span></a></span>, </span><span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Claus Kestel" itemprop="url" href="/person/19a67c8ffc810af63096c674f85ed70ad/author/3"><span itemprop="name">C. Kestel</span></a></span>, </span><span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Stephan ten Brink" itemprop="url" href="/person/19a67c8ffc810af63096c674f85ed70ad/author/4"><span itemprop="name">S. ten Brink</span></a></span>, </span><span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Timo Vogt" itemprop="url" href="/person/19a67c8ffc810af63096c674f85ed70ad/author/5"><span itemprop="name">T. Vogt</span></a></span>, </span> and <span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Norbert Wehn" itemprop="url" href="/person/19a67c8ffc810af63096c674f85ed70ad/author/6"><span itemprop="name">N. Wehn</span></a></span></span>. </span><span class="additional-entrytype-information"><span itemtype="http://schema.org/PublicationIssue" itemscope="itemscope" itemprop="isPartOf"><em><span itemprop="journal">IEEE Transactions on Communications</span>, </em> <em><span itemtype="http://schema.org/PublicationVolume" itemscope="itemscope" itemprop="isPartOf"><span itemprop="volumeNumber">73 </span></span>(<span itemprop="issueNumber">1</span>): <span itemprop="pagination">39-53</span></em> </span>(<em><span>January 2025<meta content="January 2025" itemprop="datePublished"/></span></em>)</span>Tue May 06 13:51:09 CEST 2025IEEE Transactions on Communicationsjan139-53Row-Merged Polar Codes: Analysis, Design, and Decoder Implementation732025coding myown 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 capable to perform close to the finite-length capacity bounds. However, there is still a lack of efficient design procedures for row-merged polar codes. Using novel weight enumeration algorithms with low computational complexity, we propose a design methodology for row-merged polar codes that directly considers their minimum distance properties. The codes significantly outperform state-of-the-art cyclic redundancy check (CRC)-aided polar codes under successive cancellation list (SCL) decoding in error-correction performance. Furthermore, we present fast simplified successive cancellation list (Fast-SSCL) decoding of PTPCs, based on which we derive a high-throughput, unrolled architecture template for fully pipelined decoders. Implementation results of SCL decoders for row-merged polar codes in a 12nm technology additionally demonstrate the superiority of these codes with respect to the implementation costs, compared to state-of-the-art reference decoder implementations.Row-Merged Polar Codes: Analysis, Design, and Decoder Implementation | IEEE Journals & Magazine | IEEE Xplorehttps://puma.ub.uni-stuttgart.de/bibtex/2431a23b580b6f34091d0c209bf2168db/inueinue2025-05-06T13:51:09+02:00myown coding <span data-person-type="author" class="authorEditorList "><span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Andreas Zunker" itemprop="url" href="/person/19a67c8ffc810af63096c674f85ed70ad/author/0"><span itemprop="name">A. Zunker</span></a></span>, </span><span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Marvin Geiselhart" itemprop="url" href="/person/19a67c8ffc810af63096c674f85ed70ad/author/1"><span itemprop="name">M. Geiselhart</span></a></span>, </span><span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Lucas Johannsen" itemprop="url" href="/person/19a67c8ffc810af63096c674f85ed70ad/author/2"><span itemprop="name">L. Johannsen</span></a></span>, </span><span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Claus Kestel" itemprop="url" href="/person/19a67c8ffc810af63096c674f85ed70ad/author/3"><span itemprop="name">C. Kestel</span></a></span>, </span><span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Stephan ten Brink" itemprop="url" href="/person/19a67c8ffc810af63096c674f85ed70ad/author/4"><span itemprop="name">S. ten Brink</span></a></span>, </span><span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Timo Vogt" itemprop="url" href="/person/19a67c8ffc810af63096c674f85ed70ad/author/5"><span itemprop="name">T. Vogt</span></a></span>, </span> and <span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Norbert Wehn" itemprop="url" href="/person/19a67c8ffc810af63096c674f85ed70ad/author/6"><span itemprop="name">N. Wehn</span></a></span></span>. </span><span class="additional-entrytype-information"><span itemtype="http://schema.org/PublicationIssue" itemscope="itemscope" itemprop="isPartOf"><em><span itemprop="journal">IEEE Transactions on Communications</span>, </em> <em><span itemtype="http://schema.org/PublicationVolume" itemscope="itemscope" itemprop="isPartOf"><span itemprop="volumeNumber">73 </span></span>(<span itemprop="issueNumber">1</span>): <span itemprop="pagination">39-53</span></em> </span>(<em><span>January 2025<meta content="January 2025" itemprop="datePublished"/></span></em>)</span>Tue May 06 13:51:09 CEST 2025IEEE Transactions on Communicationsjan139-53Row-Merged Polar Codes: Analysis, Design, and Decoder Implementation732025myown coding 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 capable to perform close to the finite-length capacity bounds. However, there is still a lack of efficient design procedures for row-merged polar codes. Using novel weight enumeration algorithms with low computational complexity, we propose a design methodology for row-merged polar codes that directly considers their minimum distance properties. The codes significantly outperform state-of-the-art cyclic redundancy check (CRC)-aided polar codes under successive cancellation list (SCL) decoding in error-correction performance. Furthermore, we present fast simplified successive cancellation list (Fast-SSCL) decoding of PTPCs, based on which we derive a high-throughput, unrolled architecture template for fully pipelined decoders. Implementation results of SCL decoders for row-merged polar codes in a 12nm technology additionally demonstrate the superiority of these codes with respect to the implementation costs, compared to state-of-the-art reference decoder implementations.Row-Merged Polar Codes: Analysis, Design, and Decoder Implementation | IEEE Journals & Magazine | IEEE Xplorehttps://puma.ub.uni-stuttgart.de/bibtex/2501a80ae3d850713ecb94bb36af28d00/mgeiselhartmgeiselhart2023-04-19T15:13:46+02:00coding myown <span data-person-type="author" class="authorEditorList "><span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Marvin Geiselhart" itemprop="url" href="/person/1777392a621a63a1904c357874e242839/author/0"><span itemprop="name">M. Geiselhart</span></a></span>, </span><span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Andreas Zunker" itemprop="url" href="/person/1777392a621a63a1904c357874e242839/author/1"><span itemprop="name">A. Zunker</span></a></span>, </span><span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Ahmed Elkelesh" itemprop="url" href="/person/1777392a621a63a1904c357874e242839/author/2"><span itemprop="name">A. Elkelesh</span></a></span>, </span><span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Jannis Clausius" itemprop="url" href="/person/1777392a621a63a1904c357874e242839/author/3"><span itemprop="name">J. Clausius</span></a></span>, </span> and <span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Stephan ten Brink" itemprop="url" href="/person/1777392a621a63a1904c357874e242839/author/4"><span itemprop="name">S. Brink</span></a></span></span>. </span><span class="additional-entrytype-information"><span itemtype="http://schema.org/Book" itemscope="itemscope" itemprop="isPartOf"><em><span itemprop="name">2022 56th Asilomar Conference on Signals, Systems, and Computers</span>, </em></span><em>page <span itemprop="pagination">387-391</span>. </em>(<em><span>October 2022<meta content="October 2022" itemprop="datePublished"/></span></em>)</span>Wed Apr 19 15:13:46 CEST 20232022 56th Asilomar Conference on Signals, Systems, and Computersoct387-391Graph Search based Polar Code Design2022coding myown 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) decoding, information theoretically optimal constructions are available, the code design for other decoding algorithms (such as belief propagation (BP) decoding) can only be optimized using extensive Monte Carlo simulations. We propose to view the design process of polar codes as a graph search problem and thereby approaching it more systematically. Based on this formalism, the design-time complexity can be significantly reduced compared to state-of-the-art Genetic Algorithm (GenAlg) and deep learning-based design algorithms. Moreover, sequences of rate-compatible polar codes can be efficiently found. Finally, we analyze both the complexity of the proposed algorithm and the error-rate performance of the constructed codes.Graph Search based Polar Code Design | IEEE Conference Publication | IEEE Xplorehttps://puma.ub.uni-stuttgart.de/bibtex/2501a80ae3d850713ecb94bb36af28d00/inueinue2023-04-19T15:13:46+02:00myown from:mgeiselhart coding <span data-person-type="author" class="authorEditorList "><span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Marvin Geiselhart" itemprop="url" href="/person/1777392a621a63a1904c357874e242839/author/0"><span itemprop="name">M. Geiselhart</span></a></span>, </span><span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Andreas Zunker" itemprop="url" href="/person/1777392a621a63a1904c357874e242839/author/1"><span itemprop="name">A. Zunker</span></a></span>, </span><span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Ahmed Elkelesh" itemprop="url" href="/person/1777392a621a63a1904c357874e242839/author/2"><span itemprop="name">A. Elkelesh</span></a></span>, </span><span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Jannis Clausius" itemprop="url" href="/person/1777392a621a63a1904c357874e242839/author/3"><span itemprop="name">J. Clausius</span></a></span>, </span> and <span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Stephan ten Brink" itemprop="url" href="/person/1777392a621a63a1904c357874e242839/author/4"><span itemprop="name">S. Brink</span></a></span></span>. </span><span class="additional-entrytype-information"><span itemtype="http://schema.org/Book" itemscope="itemscope" itemprop="isPartOf"><em><span itemprop="name">2022 56th Asilomar Conference on Signals, Systems, and Computers</span>, </em></span><em>page <span itemprop="pagination">387-391</span>. </em>(<em><span>October 2022<meta content="October 2022" itemprop="datePublished"/></span></em>)</span>Wed Apr 19 15:13:46 CEST 20232022 56th Asilomar Conference on Signals, Systems, and Computersoct387-391Graph Search based Polar Code Design2022myown from:mgeiselhart coding 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) decoding, information theoretically optimal constructions are available, the code design for other decoding algorithms (such as belief propagation (BP) decoding) can only be optimized using extensive Monte Carlo simulations. We propose to view the design process of polar codes as a graph search problem and thereby approaching it more systematically. Based on this formalism, the design-time complexity can be significantly reduced compared to state-of-the-art Genetic Algorithm (GenAlg) and deep learning-based design algorithms. Moreover, sequences of rate-compatible polar codes can be efficiently found. Finally, we analyze both the complexity of the proposed algorithm and the error-rate performance of the constructed codes.Graph Search based Polar Code Design | IEEE Conference Publication | IEEE Xplore