Unsourced random access
From MaRDI portal
Cites work
- \textit{CHIRRUP}: a practical algorithm for unsourced multiple access
- A Coded Compressed Sensing Scheme for Unsourced Multiple Access
- A coding model for a multiple-access adder channel
- A Combinatory Detection Problem
- A Mathematical Theory of Communication
- A perspective on multiaccess channels
- A rate-splitting approach to the Gaussian multiple-access channel
- A recursive approach to low complexity codes
- A simple derivation of the coding theorem and some applications
- A sufficient condition of nonergodicity of a Markov chain (Corresp.)
- Algebraic soft-decision decoding of reed-solomon codes
- An information-spectrum approach to capacity theorems for the general multiple-access channel
- Approximate Sparsity Pattern Recovery: Information-Theoretic Lower Bounds
- Asynchronous Massive Access and Neighbor Discovery Using OFDMA
- Binary \(B_2\)-sequences: a new upper bound
- Blind adaptive multiuser detection
- Capacity of Gaussian Many-Access Channels
- Channel Coding Rate in the Finite Blocklength Regime
- Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels
- Coded demixing for unsourced random access
- Coded Slotted ALOHA: A Graph-Based Method for Uncoordinated Multiple Access
- Coding for T-user multiple-access channels
- Compressed sensing
- Compute-and-Forward: Harnessing Interference Through Structured Codes
- Decentralized dynamic control of a multiaccess broadcast channel
- Design and analysis of nonbinary LDPC codes for arbitrary discrete-memoryless channels
- Determination of two vectors from the sum
- Efficiently decodable compressed sensing by list-recoverable codes and recursion
- Elements of Information Theory
- Energy Efficiency of Massive Random Access in MIMO Quasi-Static Rayleigh Fading Channels With Finite Blocklength
- Evaluation of the asymptotics of the summarized capacity of an \(M\)-frequency \(T\)-user noiseless multiple-access channel
- Factor graphs and the sum-product algorithm
- Forward collision resolution-a technique for random multiple-access to the adder channel
- Fundamental Limits of Many-User MAC With Finite Payloads and Fading
- Fundamentals of Wireless Communication
- Gaussian Multiple and Random Access Channels: Finite-Blocklength Analysis
- High-Throughput Random Access Using Successive Interference Cancellation in a Tree Algorithm
- scientific article; zbMATH DE number 3173126 (Why is no real title available?)
- scientific article; zbMATH DE number 5485456 (Why is no real title available?)
- scientific article; zbMATH DE number 4061904 (Why is no real title available?)
- scientific article; zbMATH DE number 54139 (Why is no real title available?)
- scientific article; zbMATH DE number 3482343 (Why is no real title available?)
- scientific article; zbMATH DE number 718142 (Why is no real title available?)
- scientific article; zbMATH DE number 3438733 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 7434519 (Why is no real title available?)
- scientific article; zbMATH DE number 3248638 (Why is no real title available?)
- Improved decoding of Reed-Solomon and algebraic-geometry codes
- Iterative multiuser joint decoding: unified framework and asymptotic analysis
- Linear multiuser detectors for synchronous code-division multiple-access channels
- Linear multiuser receivers: effective interference, effective bandwidth and user capacity
- List decoding of error-correcting codes. Winning thesis of the 2002 ACM Doctoral Dissertation Competition
- List Decoding of Polar Codes
- Minimum Energy to Send k Bits Through the Gaussian Channel With and Without Feedback
- Minimum probability of error for asynchronous Gaussian multiple-access channels
- Modern Coding Theory
- Multiple-access hyperchannel
- Network information theory
- Non-Bayesian Activity Detection, Large-Scale Fading Coefficient Estimation, and Unsourced Random Access With a Massive MIMO Receiver
- Nonbinary convolutional coding in channels with jamming
- Novel Low-Density Signature for Synchronous CDMA Systems Over AWGN Channel
- On \(B_ 2\)-sequences of vectors
- On a problem of Sidon in additive number theory and on some related problems.
- On the T-user M-frequency noiseless multiple-access channel with and without intensity information
- Optimal sequences and sum capacity of synchronous CDMA systems
- Optimum sequence multisets for synchronous code-division multiple-access channels
- Orthogonal Matching Pursuit for Sparse Signal Recovery With Noise
- Packet Switching in Radio Channels: Part I--Carrier Sense Multiple-Access Modes and Their Throughput-Delay Characteristics
- Polar Codes for the m-User Multiple Access Channel
- Polar Codes for the Two-User Multiple-Access Channel
- Quasi-Static Multiple-Antenna Fading Channels at Finite Blocklength
- Random multiple packet access: part-and-try algorithm
- Some new random multiple-access algorithms
- SPARCs for Unsourced Random Access
- Sparse regression codes
- Spectral efficiency of CDMA with random spreading
- Stable signal recovery from incomplete and inaccurate measurements
- Superimposed codes in R/sup n/
- The convex geometry of linear inverse problems
- The distribution of volume reductions induced by isotropic random projections
- The restricted isometry property of subsampled Fourier matrices
- Theoretical Results on Sparse Representations of Multiple-Measurement Vectors
- Tree algorithms for packet broadcast channels
- Unsourced multiple access with random user activity
- Unsourced Random Access With Coded Compressed Sensing: Integrating AMP and Belief Propagation
- Upper bound on the capacity of a random multiple-access system
This page was built for publication: Unsourced random access
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6911004)
