Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2024
|
| Schlagworte: | |
| Online-Zugang: | https://arxiv.org/abs/2405.06131 |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Inhaltsangabe:
- This paper investigates the relation between the second-order coding rate, where the second-order turns out to be strictly larger than $\sqrt{n}$, and the mutual information as the leaked information for a fixed error probability by using wiretap codes constructed by universal$_2$ hash functions. We first generalize the upper bound on $ε$-smooth max information in \cite{tyagi} and use it in our analysis where we adopt the method in \cite{hayashi-tan}, which uses universal hashing for compressing a source and making it secure from another correlated source, and apply it to the wiretap channel. We prove first- and second-order achievability results by assuming that the conjecture we state holds true.