Randomized and nonrandomized algorithms of random multiple access
From MaRDI portal
Publication:753784
zbMATH Open0716.94001MaRDI QIDQ753784FDOQ753784
Authors: B. S. Tsybakov 
Publication date: 1989
Published in: Problems of Information Transmission (Search for Journal in Brave)
Recommendations
- Some new random multiple-access algorithms
- Some Optimal Algorithms of Random Multiple Access
- Random access algorithms with multiple reception capability and \(n\)-ary feedback channel
- On a random process in multiple access problems
- Random matrix methods for design of multiuser communication systems
- Randomized and deterministic algorithms for network coding problems in wireless networks
- Random sequence multisets for synchronous code-division multiple-access channels
- Random multiple access in a vector disjunctive channel
- scientific article; zbMATH DE number 1222190
nonrandomized algorithmsPoisson input streamsrandom access protocolsrandom multiple access algorithms
Point processes (e.g., Poisson, Cox, Hawkes processes) (60G55) Communication theory (94A05) Probabilistic measure theory (60A10)
Cited In (10)
- On ergodic algorithms in random multiple access systems with ``success-failure feedback
- A unified minimum-search method for resolving contentions in multiaccess networks with ternary feedback
- Random multiple packet access: part-and-try algorithm
- Random access algorithms with multiple reception capability and \(n\)-ary feedback channel
- Random Time and Frequency Hopping for Infinite User Population
- Survey of USSR contributions to random multiple-access communications
- Some new random multiple-access algorithms
- Title not available (Why is that?)
- Optimizing a random access system by biased source blocking
- Random multiple access in a vector disjunctive channel
This page was built for publication: Randomized and nonrandomized algorithms of random multiple access
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q753784)
