DeepAI AI Chat
Log In Sign Up

Dynamic Frozen-Function Design for Reed-Muller Codes With Automorphism-Based Decoding

by   Samet Gelincik, et al.

In this letter, we propose to add dynamic frozen bits to underlying polar codes with a Reed-Muller information set with the aim of maintaining the same sub-decoding structure in Automorphism Ensemble (AE) and lowering the Maximum Likelihood (ML) bound by reducing the number of minimum weight codewords. We provide the dynamic freezing constraint matrix that remains identical after applying a permutation linear transformation. This feature also permits to drastically reduce the memory requirements of an AE decoder with polar-like codes having dynamic frozen bits. We show that, under AE decoding, the proposed dynamic freezing constraints lead to a gain of up to 0.25dB compared to the ML bound of the R(3,7) Reed-Muller code, at the cost of small increase in memory requirements.


page 1

page 2

page 3

page 4


Successive Cancellation Inactivation Decoding for Modified Reed-Muller and eBCH Codes

A successive cancellation (SC) decoder with inactivations is proposed as...

Algebraic matching techniques for fast decoding of polar codes with Reed-Solomon kernel

We propose to reduce the decoding complexity of polar codes with non-Ari...

Complexity-Adaptive Maximum-Likelihood Decoding of Modified G_N-Coset Codes

A complexity-adaptive tree search algorithm is proposed for G_N-coset co...

Neural network concatenation for Polar Codes

When a neural network (NN) is used to decode a polar code, its training ...

5G NR CA-Polar Maximum Likelihood Decoding by GRAND

CA-Polar codes have been selected for all control channel communications...

On the Distribution of Partially Symmetric Codes for Automorphism Ensemble Decoding

Permutation list decoding recently draws attention as a possible alterna...

Towards Optimal Decoding for Polar Codes

In the conventional successive cancellation (SC) decoder for polar codes...