The collision channel without feedback
From MaRDI portal
Recommendations
Cited in
(45)- Necessary and sufficient conditions for tight equi-difference conflict-avoiding codes of weight three
- The number of packets transmitted by collision detect random access schemes
- A stack protocol of CTM type with quartet feedback
- Information gathering in ad-hoc radio networks with tree topology
- Optimal conflict-avoiding codes of odd length and weight three
- Low-weight superimposed codes and related combinatorial structures: bounds and applications
- Partially user-irrepressible sequence sets and conflict-avoiding codes
- Partial geometric designs with prescribed automorphisms
- Optimal equi-difference conflict-avoiding codes of odd length and weight three
- Some infinite classes of optimal \({(v,\{3,4\},1,Q)}\)-OOCs with \({Q\in\{(\frac{1}{3},\frac{2}{3}),(\frac{2}{3},\frac{1}{3})\}}\)
- A tight asymptotic bound on the size of constant-weight conflict-avoiding codes
- Optimal strongly conflict-avoiding codes of even length and weight three
- On balanced optimal \((18u,\{3,4\},1)\) optical orthogonal codes
- Constructions of optimal variable-weight optical orthogonal codes
- Poisson multiple-access contention with binary feedback
- New optimal \((v, \{3,5\}, 1, Q)\) optical orthogonal codes
- Dynamic Distributed Scheduling in Random Access Networks
- The Collision Channel With Recovery
- New Protocol Sequences for Random-Access Channels Without Feedback
- User-irrepressible sequences
- Distributed communications in collision channels with errors
- Erasures and noise in splitting multiple access algorithms
- Constructions of optimal variable-weight OOCs via quadratic residues
- Concurrence probabilities for a locally slotted packet radio network by combinatorial methods
- New optimal constructions of conflict-avoiding codes of odd length and weight 3
- Constructions of protocol sequences for multiple access collision channel without feedback
- How an Erdos-Renyi-type search approach gives an explicit code construction of rate 1 for random access with multiplicity feedback
- The Offset Problem
- Capacity of the wireless packet collision channel without feedback
- Modulation and coding for the Gaussian collision channel
- scientific article; zbMATH DE number 4116454 (Why is no real title available?)
- A new series of optimal tight conflict-avoiding codes of weight 3
- Achieving Zero-Packet-Loss Throughput 1 for a Collision Channel Without Feedback and With Arbitrary Time Offsets
- Contention resolution without collision detection
- A stochastic control approach to slotted-ALOHA random access protocol
- Cover-free families and topology-transparent communication
- Optimal channel utilization with limited feedback
- Optimal channel utilization with limited feedback
- Event-triggered remote state estimation over a collision channel with incomplete information
- Maximum w‐cyclic holey group divisible packings with block size three and applications to optical orthogonal codes
- Further results on optimal (\(v,\{ 3,k \} ,1,\{ 1/2,1/2\}\))-OOCs for \(k=4,5\)
- Optimal conflict-avoiding codes of length \(n\equiv 0\pmod{16}\) and weight 3
- On cyclic \(2(k-1)\)-support \((n,k)_{k-1}\) difference families
- Quasi-optimal energy-efficient leader election algorithms in radio networks
- Conflict-avoiding codes and cyclic triple systems
This page was built for publication: The collision channel without feedback
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3677651)
