New selectors and locally thin families with applications to multi-access channels supporting simultaneous transmissions
From MaRDI portal
Publication:2333785
DOI10.1016/j.tcs.2019.08.020zbMath1455.94092OpenAlexW2967313574WikidataQ127364989 ScholiaQ127364989MaRDI QIDQ2333785
Publication date: 13 November 2019
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2019.08.020
lower boundsconflict resolutionselectorsmultiple-access channelsnon-adaptive algorithmslocally thin codes
Channel models (including quantum) in information and communication theory (94A40) Communication theory (94A05)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Bounded-contention coding for the additive network model
- On the complexity of neighbourhood learning in radio networks
- Applications of coding theory to communication combinatorial problems
- Distributed broadcast in radio networks of unknown topology.
- Constructions of generalized superimposed codes with applications to group testing and conflict resolution in multiple access channels.
- Deterministic oblivious local broadcast in the SINR model
- Parametrized complexity theory.
- Locally Thin Set Families
- Random Access With Physical-Layer Network Coding
- Efficient Distributed Communication in Ad-Hoc Radio Networks
- Optimal decentralized control in the random access multipacket channel
- Stability properties of slotted Aloha with multipacket reception capability
- Single-User Tracing and Disjointly Superimposed Codes
- Packet Multiple Access for Channel With Binary Feedback, Capture, and Multiple Reception
- Optimal Algorithms for Two Group Testing Problems, and New Bounds on Generalized Superimposed Codes
- A constructive proof of the general lovász local lemma
- Searching for a subset of counterfeit coins: Randomization vs determinism and adaptiveness vs non‐adaptiveness
- Distributed Backbone Structure for Algorithms in the SINR Model of Wireless Networks
- Deterministic broadcasting in ad hoc radio networks
- On selection problem in radio networks
- An asymptotically fast nonadaptive algorithm for conflict resolution in multiple-access channels
- Optimal Two-Stage Algorithms for Group Testing Problems
- Fundamentals of Computation Theory
- A new kind of selectors and their applications to conflict resolution in wireless multichannels networks
- Subquadratic non-adaptive threshold group testing
This page was built for publication: New selectors and locally thin families with applications to multi-access channels supporting simultaneous transmissions