Polar and Convolutional Codes for the Unequal Message Protection Problem
Fuente:
arXiv
Salvato in:
| Autori principali: | , , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2026
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866917422407090176 |
|---|---|
| author | Sauter, Alexander Schiavone, Riccardo Picado, Lucía Balsa Liva, Gianluigi |
| author_facet | Sauter, Alexander Schiavone, Riccardo Picado, Lucía Balsa Liva, Gianluigi |
| contents | This paper proposes the design of polar and convolutional coset codes for the unequal message protection (UMP) in the short blocklength regime, to overcome the rate loss introduced by preamble-based solutions. After providing conditions to ensure message class disjointness, a two-step decoding architecture is proposed: it first identifies the message class via a likelihood ratio test--computable exactly for convolutional codes and approximated for polar codes--and subsequently performs maximum (or near) likelihood decoding among the codewords of the chosen message class. Numerical results show that our construction closely tracks finite-length benchmarks. Specifically, the analyzed CRC-aided polar codes perform comparable to existing polar code approaches, without requiring specific code design, while offering a robust and spectrally efficient solution for UMP scenarios. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2604_17999 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Polar and Convolutional Codes for the Unequal Message Protection Problem Sauter, Alexander Schiavone, Riccardo Picado, Lucía Balsa Liva, Gianluigi Information Theory This paper proposes the design of polar and convolutional coset codes for the unequal message protection (UMP) in the short blocklength regime, to overcome the rate loss introduced by preamble-based solutions. After providing conditions to ensure message class disjointness, a two-step decoding architecture is proposed: it first identifies the message class via a likelihood ratio test--computable exactly for convolutional codes and approximated for polar codes--and subsequently performs maximum (or near) likelihood decoding among the codewords of the chosen message class. Numerical results show that our construction closely tracks finite-length benchmarks. Specifically, the analyzed CRC-aided polar codes perform comparable to existing polar code approaches, without requiring specific code design, while offering a robust and spectrally efficient solution for UMP scenarios. |
| title | Polar and Convolutional Codes for the Unequal Message Protection Problem |
| topic | Information Theory |
| url | https://arxiv.org/abs/2604.17999 |