Improved List Decoding for Polar-Coded Probabilistic Shaping

05/13/2023
by   Constantin Runge, et al.
0

A modified list decoder with improved error performance is proposed for polar-coded probabilistic shaping. The decoder exploits the deterministic encoding rule for shaping bits to rule out candidate code words that the encoder would not generate.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/18/2019

On Distance Properties of Convolutional Polar Codes

A lower bound on minimum distance of convolutional polar codes is provid...
research
06/27/2018

Belief Propagation List Decoding of Polar Codes

We propose a belief propagation list (BPL) decoder with comparable perfo...
research
11/04/2021

A Dynamic Programming Method to Construct Polar Codes with Improved Performance

In the standard polar code construction, the message vector (U_0,U_1,…,U...
research
12/07/2018

Polar-Coded Pulse Position Modulation for the Poisson Channel

A polar-coded modulation scheme for deep-space optical communication is ...
research
01/12/2018

Belief Propagation Decoding of Polar Codes on Permuted Factor Graphs

We show that the performance of iterative belief propagation (BP) decodi...
research
01/18/2022

Polar Coded Merkle Tree: Improved Detection of Data Availability Attacks in Blockchain Systems

Lights nodes are commonly used in blockchain systems to combat the stora...
research
01/27/2021

List-Decodable Coded Computing: Breaking the Adversarial Toleration Barrier

We consider the problem of coded computing where a computational task is...

Please sign up or login with your details

Forgot password? Click here to reset