Image de couverture de livre

SURA: Secure Unsourced Random Access

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Ahmadi, Mohammad Javad, Schaefer, Rafael F., Poor, H. Vincent
Format:	Preprint
Publié:	2025
Sujets:	Information Theory
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Integrated Sensing and Communications for Unsourced Random Access: Fundamental Limits
par: Ahmadi, Mohammad Javad, et autres
Publié: (2024)

Efficient Feedback Design for Unsourced Random Access with Integrated Sensing and Communication
par: Ahmadi, Mohammad Javad, et autres
Publié: (2025)

Unsourced Random Access: A Comprehensive Survey
par: Ozates, Mert, et autres
Publié: (2024)

RIS-Aided Unsourced Multiple Access (RISUMA): Coding Strategy and Performance Limits
par: Ahmadi, Mohammad Javad, et autres
Publié: (2024)

Sparse Code Transceiver Design for Unsourced Random Access with Analytical Power Division in Gaussian MAC
par: Zhang, Zhentian, et autres
Publié: (2025)

Unsourced Random Access in MIMO Quasi-Static Rayleigh Fading Channels: Finite Blocklength and Scaling Law Analyses
par: Gao, Junyuan, et autres
Publié: (2025)

Unsourced Random Access
par: Andreev, Kirill, et autres
Publié: (2025)

Fully Asynchronous Unsourced Random Access over Fading Channels
par: Ozates, Mert, et autres
Publié: (2025)

Iterative Gaussian Approximation for Random Spreading Unsourced Random Access
par: Hu, Liandong, et autres
Publié: (2025)

Reliability and Latency Analysis for Wireless Communication Systems with a Secret-Key Budget
par: Besser, Karl-Ludwig, et autres
Publié: (2023)

Unsourced Multiple Access: A Coding Paradigm for Massive Random Access
par: Liva, Gianluigi, et autres
Publié: (2024)

An ODMA-Based Unsourced Random Access Scheme with a Multiple Antenna Receiver
par: Ozates, Mert, et autres
Publié: (2024)

Characterization of the Arithmetic Complexity of the Secrecy Capacity of Fast-Fading Gaussian Channels
par: Boche, Holger, et autres
Publié: (2025)

Finite Blocklength Performance of Capacity-achieving Codes in the Light of Complexity Theory
par: Boche, Holger, et autres
Publié: (2024)

Building Resilience in Wireless Communication Systems With a Secret-Key Budget
par: Besser, Karl-Ludwig, et autres
Publié: (2024)

Massive Unsourced Random Access for Near-Field Communications
par: Xie, Xinyu, et autres
Publié: (2024)

Sparsity-Exploiting Channel Estimation For Unsourced Random Access With Fluid Antenna
par: Zhou, Keru, et autres
Publié: (2025)

ODMA-Based Cell-Free Unsourced Random Access with Successive Interference Cancellation
par: Ozates, Mert, et autres
Publié: (2025)

Type-Based Unsourced Multiple Access
par: Ngo, Khac-Hoang, et autres
Publié: (2024)

Energy Efficiency of Unsourced Random Access over the Binary-Input Gaussian Channel
par: Glebov, Anton, et autres
Publié: (2023)

Design and Analysis of Massive Uncoupled Unsourced Random Access with Bayesian Joint Decoding
par: Tian, Feiyan, et autres
Publié: (2024)

Diffusion Denoiser Achievable Analysis for Finite Blocklength Unsourced Random Access
par: Han, Yuming, et autres
Publié: (2026)

Asynchronous MIMO-OFDM Massive Unsourced Random Access with Codeword Collisions
par: Li, Tianya, et autres
Publié: (2024)

On Fundamental Limits for Fluid Antenna-assisted Integrated Sensing and Communications for Unsourced Random Access
par: Zhang, Zhentian, et autres
Publié: (2025)

Pilot-Free Unsourced Random Access Via Dictionary Learning and Error-Correcting Codes
par: Zhang, Zhentian, et autres
Publié: (2023)

Unsourced Random Access in MIMO Quasi-Static Rayleigh Fading Channels with Finite Blocklength
par: Gao, Junyuan, et autres
Publié: (2024)

Exploiting Matrix Information Geometry for Integrated Decoding of Massive Uncoupled Unsourced Random Access
par: Tian, Feiyan, et autres
Publié: (2024)

Probabilistic ODMA Receiver with Low-Complexity Algorithm for MIMO Unsourced Random Access
par: Zhang, Zhentian, et autres
Publié: (2025)

Integrated Sensing and Communications for Unsourced Random Access: A Spectrum Sharing Compressive Sensing Approach
par: Zhang, Zhentian, et autres
Publié: (2025)

An Achievability Bound for Type-Based Unsourced Multiple Access
par: Krishnan, Deekshith Pathayappilly, et autres
Publié: (2025)

Joint Message Detection, Channel, and User Position Estimation for Unsourced Random Access in Cell-Free Networks
par: Gkiouzepi, Eleni, et autres
Publié: (2024)

Generative Diffusion Model Driven Massive Random Access in Massive MIMO Systems
par: Ying, Keke, et autres
Publié: (2025)

Evolution of the 5G New Radio Two-Step Random Access towards 6G Unsourced MAC
par: Agostini, Patrick, et autres
Publié: (2024)

Joint Message Detection and Channel Estimation for Unsourced Random Access in Cell-Free User-Centric Wireless Networks
par: Çakmak, Burak, et autres
Publié: (2023)

Unsourced Sparse Multiple Access foUnsourced Sparse Multiple Access for 6G Massive Communicationr 6G Massive Communication
par: Yuan, Yifei, et autres
Publié: (2024)

Semantic Communication: From Philosophical Conceptions Towards a Mathematical Framework
par: Gholipour, Javad, et autres
Publié: (2025)

Semantic Communication Through the Lens of Context-Dependent Channel Modeling
par: Gholipour, Javad, et autres
Publié: (2026)

An Investigation of the Compressed Sensing Phase in Unsourced Multiple Access
par: Clazzer, Federico, et autres
Publié: (2024)

Wrap-Decoding in Asynchronous Unsourced Multiple Access With and Without Delay Information
par: Wu, Jyun-Sian, et autres
Publié: (2025)

Removal of Small Weight Stopping Sets for Asynchronous Unsourced Multiple Access
par: Ritter, Frederik, et autres
Publié: (2025)