research
∙
09/25/2021
Fast Successive-Cancellation List Flip Decoding of Polar Codes
This work presents a fast successive-cancellation list flip (Fast-SCLF) ...
share
research
∙
09/05/2021
Decoding Reed-Muller Codes with Successive Factor-Graph Permutations
This paper presents a novel successive factor-graph permutation (SFP) sc...
research
∙
08/28/2021
Successive-Cancellation Decoding of Reed-Muller Codes with Fast Hadamard Transform
In this paper we propose efficient decoding techniques to significantly ...
research
∙
07/19/2021
A Tree Search Approach for Maximum-Likelihood Decoding of Reed-Muller Codes
A low-complexity tree search approach is presented that achieves the max...
research
∙
09/17/2020
Practical Dynamic SC-Flip Polar Decoders: Algorithm and Implementation
SC-Flip (SCF) is a low-complexity polar code decoding algorithm with imp...
research
∙
09/15/2020
Decoding Polar Codes with Reinforcement Learning
In this paper we address the problem of selecting factor-graph permutati...
research
∙
12/02/2019
Deep-Learning-Aided Successive-Cancellation Decoding of Polar Codes
A deep-learning-aided successive-cancellation list (DL-SCL) decoding alg...
research
∙
07/26/2019
Neural Dynamic Successive Cancellation Flip Decoding of Polar Codes
Dynamic successive cancellation flip (DSCF) decoding of polar codes is a...
research
∙
10/31/2018
Neural Belief Propagation Decoding of CRC-Polar Concatenated Codes
Polar codes are the first class of error correcting codes that provably ...
research
∙
07/11/2018
Decoding Reed-Muller and Polar Codes by Successive Factor Graph Permutations
Reed-Muller (RM) and polar codes are a class of capacity-achieving chann...
research
∙
06/28/2018