PAC Codes for Source and Joint Source-Channel Coding
Mengfan Zheng, Cong Ling
TL;DR
This paper extends polarization-adjusted convolutional (PAC) codes to source and joint source-channel coding, demonstrating their ability to approach finite-length bounds at short blocklengths in these new contexts.
Contribution
The paper introduces PAC codes for source and joint source-channel coding, expanding their application beyond channel coding and showing their effectiveness at short blocklengths.
Findings
PAC codes can approach finite-length bounds in source coding
PAC codes can be effectively applied to joint source-channel coding
Short blocklength performance is comparable to theoretical limits
Abstract
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsError Correcting Code Techniques · Advanced Wireless Communication Techniques · Cooperative Communication and Network Coding