Improved list-decoding for polar coded shaping
Munich Workshop on Coding and Cryptography (MWCC)
Munich, Germany
2024
Improved list-decoding for polar coded shaping
Munich Workshop on Shannon Coding Techniques (MSCT)
Munich, Germany
2024
Time-Shifted Alternating Gelfand Pinsker Coding
European School of Information Theory (ESIT)
Eindhoven, Netherlands
2024
Time-Shifted Alternating Gelfand-Pinsker Coding for Broadcast Channels
1700-1705
IEEE International Symposium on Information Theory (ISIT)
Athens, Greece
IEEE
2024
Polar Shaped Hamming Codes
Joint Workshop on Communications and Coding (JWCC)
Garmisch-Partenkirchen, Germany
2023
List Decoding for Polar-Coded Probabilistic Shaping
European School of Information Theory (ESIT)
Bristol, UK
2023
Polar Distribution Matching with Hard Constraints
European School of Information Theory (ESIT)
Vienna, Austria
2022
Improved List Decoding for Polar-Coded Probabilistic Shaping
12th International Symposium on Topics in Coding (ISTC)
Brest, France
IEEE
2023
Higher-Order Polar-Coded Modulation for Asymmetric Channels
This thesis proposes a coded modulation scheme to implement probabilistic shaping with arbitrary symbol distributions. The considered scheme is based on polar codes, a class of capacity-achieving, linear block codes with state-of-the-art finite-length performance and an explicit construction. The scheme is analysed from a theoretical standpoint as well as with numerical simulations. Furthermore, an extension to this scheme for state-dependent shaping is proposed, as well as an application to dirty paper coding. The effectiveness of this extension is shown in numerical simulations and its convergence properties are discussed.
2021
Multilevel Binary Polar-Coded Modulation Achieving the Capacity of Asymmetric Channels
IEEE International Symposium on Information Theory (ISIT)
Espoo, Finland
2022