Regular LDPC codes on BMS wiretap channels: Security bounds

2025/02/09 by Madhura Pathegama, Alexander Barg, Pathegama, Madhura +1 · 1 voice
Computer Science · Engineering · #Cooperative Communication and Network Coding #Error Correcting Code Techniques #Wireless Communication Security Techniques #cs.IT

paper · pdf · doi:10.48550/arxiv.2502.06058

Abstract

We improve the secrecy guarantees for transmission over general binary memoryless symmetric wiretap channels that relies on regular LDPC codes. Previous works showed that LDPC codes achieve secrecy capacity of some classes of wiretap channels while leaking o(n) bits of information over n uses of the channel. In this note, we improve the security component of these results by reducing the leakage parameter to O(log² n). While this result stops short of proving strong security, it goes beyond the general secrecy guarantees derived from properties of capacity-approaching code families.

Discussions

• Madhura Pathegama, Alexander Barg: Regular LDPC codes on BMS wiretap channels: Security bounds https://arxiv.org/abs/2502.06058 https://arxiv.org/pdf/2502.06058 https://arxiv.org/html/2502.06058 [bsky, 0 points, 1 comments]

Related

• Applications of LDPC Codes to the Wiretap Channel
• Security for adversarial wiretap channels
• Capacity Results for Arbitrarily Varying Wiretap Channels
• Analysis of Short Blocklength Codes for Secrecy
• Finite-Blocklength Bounds for Wiretap Channels