The collision channel without feedback
From MaRDI portal
Publication:3677651
DOI10.1109/TIT.1985.1057010zbMath0563.94010OpenAlexW2099505289MaRDI QIDQ3677651
Publication date: 1985
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.1985.1057010
Channel models (including quantum) in information and communication theory (94A40) Communication theory (94A05)
Related Items (26)
Optimal strongly conflict-avoiding codes of even length and weight three ⋮ On cyclic \(2(k-1)\)-support \((n,k)_{k-1}\) difference families ⋮ Partial geometric designs with prescribed automorphisms ⋮ On Balanced Optimal (18u,{3,4},1) Optical Orthogonal Codes ⋮ 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 ⋮ New optimal \((v, \{3,5\}, 1, Q)\) optical orthogonal codes ⋮ Quasi-optimal energy-efficient leader election algorithms in radio networks ⋮ Constructions of optimal variable-weight OOCs via quadratic residues ⋮ Further results on optimal (\(v,\{ 3,k \} ,1,\{ 1/2,1/2\}\))-OOCs for \(k=4,5\) ⋮ Information gathering in ad-hoc radio networks with tree topology ⋮ New optimal constructions of conflict-avoiding codes of odd length and weight 3 ⋮ 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 ⋮ Dynamic Distributed Scheduling in Random Access Networks ⋮ Conflict-avoiding codes and cyclic triple systems ⋮ A stack protocol of CTM type with quartet feedback ⋮ A new series of optimal tight conflict-avoiding codes of weight 3 ⋮ Optimal conflict-avoiding codes of odd length and weight three ⋮ Constructions of optimal variable-weight optical orthogonal codes ⋮ Low-weight superimposed codes and related combinatorial structures: bounds and applications ⋮ Optimal conflict-avoiding codes of length \(n\equiv 0\pmod{16}\) and weight 3 ⋮ Necessary and sufficient conditions for tight equi-difference conflict-avoiding codes of weight three ⋮ A stochastic control approach to Slotted-ALOHA random access protocol ⋮ Partially user-irrepressible sequence sets and conflict-avoiding codes
This page was built for publication: The collision channel without feedback
