| Turing Meets Shannon: On the Algorithmic Construction of Channel-Aware Codes | 0 | 0.34 | 2022 |
| Code Constructions and Bounds for Identification via Channels | 0 | 0.34 | 2022 |
| Joint Active and Passive Secure Precoding in IRS-Aided MIMO Systems | 0 | 0.34 | 2021 |
| A Reverse Jensen Inequality Result with Application to Mutual Information Estimation. | 0 | 0.34 | 2021 |
| Reinforce Security: A Model-Free Approach Towards Secure Wiretap Coding | 0 | 0.34 | 2021 |
| Securing Massive MIMO Systems: Secrecy for Free With Low-Complexity Architectures | 1 | 0.35 | 2021 |
| Secure Communication and Identification Systems - Effective Performance Evaluation on Turing Machines. | 0 | 0.34 | 2020 |
| Neural Mutual Information Estimation For Channel Coding: State-Of-The-Art Estimators, Analysis, And Performance Comparison | 0 | 0.34 | 2020 |
| Shannon Meets Turing: Non-Computability And Non-Approximability Of The Finite State Channel Capacity | 0 | 0.34 | 2020 |
| Biometric and Physical Identifiers with Correlated Noise for Controllable Private Authentication | 0 | 0.34 | 2020 |
| New Capacity Results for Fading Gaussian Multiuser Channels With Statistical CSIT | 0 | 0.34 | 2020 |
| On the ϵ-Capacity of Finite Compound Channels with Applications to the Strong Converse and Second Order Coding Rate | 0 | 0.34 | 2020 |
| Secure Transmission in IRS-Assisted MIMO Systems with Active Eavesdroppers | 2 | 0.35 | 2020 |
| Secure Storage Capacity Under Rate Constraints - Continuity and Super Activation. | 0 | 0.34 | 2020 |
| Low-complexity and Reliable Transforms for Physical Unclonable Functions | 0 | 0.34 | 2020 |
| Deep learning based wiretap coding via mutual information estimation | 0 | 0.34 | 2020 |
| On the Algorithmic Computability of Achievability and Converse - ϵ-Capacity of Compound Channels and Asymptotic Bounds of Error-Correcting Codes. | 0 | 0.34 | 2020 |
| Deep Learning For Channel Coding Via Neural Mutual Information Estimation | 1 | 0.35 | 2019 |
| On the Algorithmic Computability of the Secret Key and Authentication Capacity Under Channel, Storage, and Privacy Leakage Constraints. | 3 | 0.41 | 2019 |
| Identification Capacity Of Correlation-Assisted Discrete Memoryless Channels: Analytical Properties And Representations | 0 | 0.34 | 2019 |
| Copulas and Multi-User Channel Orders | 0 | 0.34 | 2019 |
| Detectability Of Denial-Of-Service Attacks On Communication Systems | 0 | 0.34 | 2019 |
| Resource Allocation for Secure Communication Systems: Algorithmic Solvability | 0 | 0.34 | 2019 |
| On Stochastic Orders And Fading Gaussian Multi-User Channels With Statistical Csit | 0 | 0.34 | 2019 |
| On D2d Caching With Uncoded Cache Placement | 0 | 0.34 | 2019 |
| On the Structure of the Capacity Formula for General Finite State Channels with Applications | 1 | 0.37 | 2019 |
| Coding for Non-IID Sources and Channels: Entropic Approximations and a Question of Ahlswede | 2 | 0.39 | 2019 |
| Secure Regularized Zero Forcing For Multiuser Mimome Channels | 0 | 0.34 | 2019 |
| On the Optimality of D2D Coded Caching With Uncoded Cache Placement and One-Shot Delivery | 8 | 0.65 | 2019 |
| Turing Meets Shannon - On the Algorithmic Computability of the Capacities of Secure Communication Systems (Invited Paper). | 0 | 0.34 | 2019 |
| Joint User Selection And Precoding In Multiuser Mimo Systems Via Group Lasso | 0 | 0.34 | 2019 |
| Private Authentication with Physical Identifiers Through Broadcast Channel Measurements | 0 | 0.34 | 2019 |
| On The Computability Of The Secret Key Capacity Under Rate Constraints | 0 | 0.34 | 2019 |
| Secrecy Capacity Under List Decoding For A Channel with A Passive Eavesdropper and an Active Jammer. | 0 | 0.34 | 2018 |
| Full-Duplex Relaying with Improper Gaussian Signaling over Nakagami-m Fading Channels. | 4 | 0.39 | 2018 |
| Controllable Identifier Measurements for Private Authentication With Secret Keys. | 1 | 0.35 | 2018 |
| Privacy Amplification: Recent Developments and Applications | 0 | 0.34 | 2018 |
| Performance Evaluation of Secure Communication Systems on Turing Machines | 0 | 0.34 | 2018 |
| Iterative Antenna Selection for Secrecy Enhancement in Massive MIMO Wiretap Channels. | 0 | 0.34 | 2018 |
| The Deterministic and Correlated Random Public-Confidential Capacity Regions of the Arbitrarily Varying Wiretap Channel | 0 | 0.34 | 2018 |
| Deep Learning for the Gaussian Wiretap Channel | 1 | 0.36 | 2018 |
| Identification over Channels with Feedback: Discontinuity Behavior and Super-Activation | 1 | 0.35 | 2018 |
| Strong Secrecy for Interference Channels Based on Channel Resolvability. | 1 | 0.35 | 2018 |
| Secure Broadcasting Using Independent Secret Keys. | 2 | 0.36 | 2018 |
| Secure Communication in Spectrum-Sharing Massive MIMO Systems With Active Eavesdropping. | 5 | 0.39 | 2018 |
| On Robustness of Massive MIMO Systems Against Passive Eavesdropping under Antenna Selection. | 0 | 0.34 | 2018 |
| Analytical Properties of Shannon's Capacity of Arbitrarily Varying Channels under List Decoding: Super-Additivity and Discontinuity Behavior. | 0 | 0.34 | 2018 |
| Optimal Transmit Antenna Selection for Massive MIMO Wiretap Channels. | 3 | 0.40 | 2018 |
| Secure and Reliable Key Agreement with Physical Unclonable Functions. | 0 | 0.34 | 2018 |
| Secret-Key Generation and Convexity of the Rate Region Using Infinite Compound Sources. | 1 | 0.35 | 2018 |
