PAC Codes for Source and Joint Source-Channel Coding

08/10/2023
by   Mengfan Zheng, et al.
0

Polarization-adjusted convolutional (PAC) codes, as a concatenated coding scheme based on polar codes, is able to approach the finite-length bound of binary-input AWGN channel at short blocklengths. In this paper, we extend PAC codes to the fields of source coding and joint source-channel coding and show that they can also approach the corresponding finite-length bounds at short blocklengths.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/04/2023

Minimum Distance of PAC Codes v. Polar Codes Using Cyclic Shift Matrices

The polarization-adjusted convolutional (PAC) codes are a new family of ...
research
06/16/2021

Concatenated Reed-Solomon and Polarization-Adjusted Convolutional (PAC) Codes

Two concatenated coding schemes incorporating algebraic Reed-Solomon (RS...
research
11/06/2020

On Systematic Polarization-Adjusted Convolutional (PAC) Codes

Polarization-adjusted convolutional (PAC) codes were recently proposed a...
research
11/19/2018

NECST: Neural Joint Source-Channel Coding

For reliable transmission across a noisy communication channel, classica...
research
05/21/2020

An Importance Aware Weighted Coding Theorem Using Message Importance Measure

There are numerous scenarios in source coding where not only the code le...
research
02/19/2018

Deep Learning for Joint Source-Channel Coding of Text

We consider the problem of joint source and channel coding of structured...
research
02/25/2022

Approximate Weight Distribution of Polarization-Adjusted Convolutional (PAC) Codes

Polarization-adjusted convolutional (PAC) codes combine the polar and co...

Please sign up or login with your details

Forgot password? Click here to reset