Constituent Automorphism Decoding of Reed-Muller Codes
Guardado en:
| Publicado en: | ProQuest Dissertations and Theses (2025) |
|---|---|
| Autor principal: | |
| Publicado: |
ProQuest Dissertations & Theses
|
| Materias: | |
| Acceso en línea: | Citation/Abstract Full Text - PDF |
| Etiquetas: |
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
MARC
| LEADER | 00000nab a2200000uu 4500 | ||
|---|---|---|---|
| 001 | 3191911113 | ||
| 003 | UK-CbPIL | ||
| 020 | |a 9798310390218 | ||
| 035 | |a 3191911113 | ||
| 045 | 2 | |b d20250101 |b d20251231 | |
| 084 | |a 66569 |2 nlm | ||
| 100 | 1 | |a Qu, Yicheng | |
| 245 | 1 | |a Constituent Automorphism Decoding of Reed-Muller Codes | |
| 260 | |b ProQuest Dissertations & Theses |c 2025 | ||
| 513 | |a Dissertation/Thesis | ||
| 520 | 3 | |a Inspired by a state-of-the-art decoder for Reed–Muller (RM) codes called automorphism ensemble (AE) decoding, constituent automorphism (CA) decoding, a new decoding algorithm for RM codes is devised in this thesis. Unlike AE decoders, which only focus on the RM code itself, CA decoders distribute decoding resources to crucial constituent codes, making the decoding process more efficient. This thesis analyzes the complexity of several decoders for RM codes and compares their performance-complexity tradeoffs. Software simulations show that the best CA decoders for high-order (r ≥ 4, m ≥ 7) RM codes achieve a gain with at least 0.2 dB compared with AE decoders of the same complexity.  | |
| 653 | |a Communication | ||
| 653 | |a Computer science | ||
| 653 | |a Information technology | ||
| 773 | 0 | |t ProQuest Dissertations and Theses |g (2025) | |
| 786 | 0 | |d ProQuest |t ProQuest Dissertations & Theses Global | |
| 856 | 4 | 1 | |3 Citation/Abstract |u https://www.proquest.com/docview/3191911113/abstract/embedded/7BTGNMKEMPT1V9Z2?source=fedsrch |
| 856 | 4 | 0 | |3 Full Text - PDF |u https://www.proquest.com/docview/3191911113/fulltextPDF/embedded/7BTGNMKEMPT1V9Z2?source=fedsrch |