English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Zendy Plus

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Zendy Tools

Zendy Open

In this paper, we consider a semi-deterministic wiretap channel where themain channel is noiseless and the eavesdropper's channel is a binary erasurechannel (BEC). We provide a lower bound for the achievable secrecy rates ofpolar and Reed Muller codes and compare it to the second order coding rate forthe semi-deterministic wiretap channel. To the best of our knowledge, this isthe first work which demonstrates the secrecy performance of polar andReed-Muller codes in short blocklengths. The results show that under a totalvariation secrecy metric, Reed Muller codes can achieve secrecy rates veryclose to the second order approximation rate. On the other hand, we observe asignificant gap between the lower bound for the achievable rates of polar codesand the the second order approximation rate for short blocklengths.

Finite Blocklength Secrecy Analysis of Polar and Reed-Muller Codes in BEC Semi-Deterministic Wiretap Channels