Search Results for author:
Found 6 papers, 4 papers with code
Automorphism Ensemble Decoding of Reed-Muller Codes
Reed-Muller (RM) codes are known for their good maximum likelihood (ML) performance in the short block-length regime.
Information Theory Information Theory
Iterative Detection and Decoding of Finite-Length Polar Codes in Gaussian Multiple Access Channels
We consider the usage of finite-length polar codes for the Gaussian multiple access channel (GMAC) with a finite number of users.
Information Theory Information Theory
Deep Learning-based Polar Code Design
In this work, we introduce a deep learning-based polar code construction algorithm.
Decoder-in-the-Loop: Genetic Optimization-based LDPC Code Design
Moreover, GenAlg can be used to design LDPC codes with the aim of reducing decoding latency and complexity, leading to coding gains of up to $0. 325$ dB and $0. 8$ dB at BLER of $10^{-5}$ for both AWGN and Rayleigh fading channels, respectively, when compared to state-of-the-art short LDPC codes.
Information Theory Information Theory
Decoder-tailored Polar Code Design Using the Genetic Algorithm
We propose a new framework for constructing polar codes (i. e., selecting the frozen bit positions) for arbitrary channels, and tailored to a given decoding algorithm, rather than based on the (not necessarily optimal) assumption of successive cancellation (SC) decoding.
Genetic Algorithm-based Polar Code Construction for the AWGN Channel
We propose a new polar code construction framework (i. e., selecting the frozen bit positions) for the additive white Gaussian noise (AWGN) channel, tailored to a given decoding algorithm, rather than based on the (not necessarily optimal) assumption of successive cancellation (SC) decoding.
