Common Randomness Generation from Finite Compound Sources
IEEE International Symposium on Information Theory
ISIT2024
IEEE
2024
Information-Theoretically Secret Reed-Muller Identification with Affine Designs
European Wireless 2023
2023
Improving upper and lower bounds for the security performance of wiretap channels
IEEE Global Communications Conference
GLOBECOM
IEEE
2023
Identification Over Additive Noise Channels in the Presence of Feedback
IEEE Transactions on Information Theory
2023
69
Nov
6811 - 6821
Semantic Secrecy Assessment of Physical Layer Security in 5G NR Uplink Transmissions Under Fading Channel Conditions
IEEE Global Communications Conference
GLOBECOM
IEEE
2023
Message Transmission and Common Randomness Generation over MIMO Slow Fading Channels with Arbitrary Channel State Distribution
IEEE Transactions on Information Theory
2023
70
1
Sep
256 - 281
A Lower and Upper Bound on the Epsilon-Uniform Common Randomness Capacity
2023 IEEE International Symposium on Information Theory
ISIT
IEEE
2023
A Proof of a Single-Letter Capacity Formula for MIMO Gauss-Markov Rayleigh Fading Channels
IEEE Transactions on Information Theory
2023
69
11
Jul
6878 - 6896
Statistical verification of upper and lower bounds for the security performance of wiretap channels
IEEE Wireless Communications and Networking Conference
WCNC
IEEE
2023