Achieving Optimal Short-Blocklength Secrecy Rate Using Multi-Kernel PAC Codes for the Binary Erasure Wiretap Channel
Hsuan-Yin Lin, Yi-Sheng Su, and Mao-Ching Chiu

TL;DR
This paper demonstrates that multi-kernel polarization-adjusted convolutional codes can achieve optimal secrecy rates for short blocklengths in a binary erasure wiretap channel, balancing secrecy and efficiency.
Contribution
It introduces the use of MK-PAC codes for short-blocklength secrecy in the BE-WTC, achieving theoretical secrecy limits at small blocklengths.
Findings
MK-PAC codes achieve optimal secrecy rates at blocklengths 16, 32, 64, and 128.
Secrecy leakage can be controlled to meet theoretical bounds.
Effective for semi-deterministic binary erasure wiretap channels.
Abstract
We investigate practical short-blocklength coding for the semi-deterministic binary erasure wiretap channel (BE-WTC), where the main channel to the legitimate receiver is noiseless, and the eavesdropper's channel is a binary erasure channel (BEC). It is shown that under the average total variation distance secrecy metric, multi-kernel polarization-adjusted convolutional (MK-PAC) codes can achieve the best possible theoretical secrecy rate at blocklengths of 16, 32, 64, and 128 if the secrecy leakage is less than or equal to certain values.
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 · Wireless Communication Security Techniques
