Constructions of protocol sequences for multiple access collision channel without feedback
From MaRDI portal
Publication:4307404
DOI10.1109/18.259673zbMath0799.94005OpenAlexW2122942137MaRDI QIDQ4307404
Publication date: 3 October 1994
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/2676e9a40818e3e692668f302fdeb8fbf03ab5f3
Cyclic codes (94B15) Channel models (including quantum) in information and communication theory (94A40)
Related Items (17)
Optimal strongly conflict-avoiding codes of even length and weight three ⋮ Optimal equi-difference conflict-avoiding codes of odd length and weight three ⋮ A tight asymptotic bound on the size of constant-weight conflict-avoiding codes ⋮ Information gathering in ad-hoc radio networks with tree topology ⋮ Certain diagonal equations and conflict-avoiding codes of prime lengths ⋮ Optimal 2-D \((n\times m,3,2,1)\)-optical orthogonal codes and related equi-difference conflict avoiding codes ⋮ New optimal constructions of conflict-avoiding codes of odd length and weight 3 ⋮ Conflict-avoiding codes and cyclic triple systems ⋮ Weighted maximum matchings and optimal equi-difference conflict-avoiding codes ⋮ Coding for a multiple access OR channel: A survey ⋮ A new series of optimal tight conflict-avoiding codes of weight 3 ⋮ Optimal conflict-avoiding codes of odd length and weight three ⋮ Optimal Tight Equi‐Difference Conflict‐Avoiding Codes of Length n = 2k ± 1 and Weight 3 ⋮ Optimal conflict-avoiding codes of length \(n\equiv 0\pmod{16}\) and weight 3 ⋮ On the cyclic order distribution and partitioning of linear cyclic codes ⋮ Necessary and sufficient conditions for tight equi-difference conflict-avoiding codes of weight three ⋮ Coding for a Multiple Access OR Channel: a Survey
This page was built for publication: Constructions of protocol sequences for multiple access collision channel without feedback
