Adaptive List Flip Decoder for Polar Codes with High-Order Error Correction Capability and a Simplified Flip Metric [PDF]
Designing an efficient decoder is an effective way to improve the performance of polar codes with limited code length. List flip decoders have received attention due to their good performance trade-off between list decoders and flip decoders.
Yansong Lv +4 more
doaj +2 more sources
Higher-Order Belief Propagation Correction Decoder for Polar Codes [PDF]
Belief propagation (BP) decoding for polar codes has been extensively studied because of its inherent parallelism. However, its performance remains inferior to that of successive cancellation list decoding (SCL) due to the structure of the decoding graph.
Meng Zhang +3 more
doaj +2 more sources
Fast Successive-Cancellation List Flip Decoding of Polar Codes [PDF]
This work presents a fast successive-cancellation list flip (Fast-SCLF) decoding algorithm for polar codes that addresses the high latency issue associated with the successive-cancellation list flip (SCLF) decoding algorithm.
Nghia Doan +2 more
doaj +3 more sources
Restart Mechanisms for the Successive-Cancellation List-Flip Decoding of Polar Codes [PDF]
Polar codes concatenated with a cyclic redundancy check (CRC) code have been selected in the 5G standard with the successive-cancellation list (SCL) of list size L = 8 as the baseline algorithm.
Charles Pillet +3 more
doaj +2 more sources
Improving Polar-Coded SCMA System by Information Coupling and Parity Check [PDF]
In this paper, the uplink information-coupled polar-coded sparse code multiple access (PC-SCMA) system is proposed. For this system, we first design the encoding method of systematic joint parity check and CRC-aided (PCCA) polar code.
Xi Wu, Yafeng Wang
doaj +2 more sources
Low-Complexity Automorphism Ensemble Decoding of Reed-Muller Codes Using Path Pruning [PDF]
The newly developed automorphism ensemble decoder (AED) leverages the rich automorphisms of Reed–Muller (RM) codes to achieve near maximum likelihood (ML) performance at short code lengths.
Kairui Tian, Rongke Liu, Zheng Lu
doaj +2 more sources
Quasi-Optimal Path Convergence-Aided Automorphism Ensemble Decoding of Reed–Muller Codes [PDF]
By exploiting the rich automorphisms of Reed–Muller (RM) codes, the recently developed automorphism ensemble (AE) successive cancellation (SC) decoder achieves a near-maximum-likelihood (ML) performance for short block lengths.
Kairui Tian +3 more
doaj +2 more sources
Bidirectional stack decoding of polar codes [PDF]
Introduction/purpose: The paper introduces a reduced latency stack decoding algorithm of polar codes, inspired by the bidirectional stack decoding of convolutional codes and based on the folding technique.
Aleksandar Đ. Minja +2 more
doaj +1 more source
An improved path splitting strategy on successive cancellation list decoder for polar codes
The performance of the cyclic redundancy check aided successive cancellation list (CA‐SCL) decoder for polar codes exceeds that of the Turbo codes and the Low Density Parity Check (LDPC) codes adopted in the World Interoperability for Microwave Access ...
Yunlong Peng, Jingyun Bao, Xingcheng Liu
doaj +1 more source
Wireless Covert Communication with Polarization Dirty Constellation
Wireless covert communication is an emerging communication technique that prevents eavesdroppers. This paper presents a novel approach to wireless covert communication based on polar codes with dirty constellation polarization.
Mingyu Hu, Sen Qiao, Xiaopeng Ji
doaj +1 more source

