Constructions of protocol sequences for multiple access collision channel without feedback
From MaRDI portal
Publication:4307404
DOI10.1109/18.259673zbMATH Open0799.94005OpenAlexW2122942137MaRDI QIDQ4307404FDOQ4307404
Authors: László Györfi, István Vajda 
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
Recommendations
Cyclic codes (94B15) Channel models (including quantum) in information and communication theory (94A40)
Cited In (22)
- Coding for a Multiple Access OR Channel: a Survey
- New optimal constructions of conflict-avoiding codes of odd length and weight 3
- 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
- Optimal strongly conflict-avoiding codes of even length and weight three
- Achieving Zero-Packet-Loss Throughput 1 for a Collision Channel Without Feedback and With Arbitrary Time Offsets
- Conflict-avoiding codes and cyclic triple systems
- Optimal tight equi-difference conflict-avoiding codes of length \(n = 2^{k} \pm 1\) and weight 3
- Optimal conflict-avoiding codes of odd length and weight three
- User-irrepressible sequences
- Title not available (Why is that?)
- Optimal equi-difference conflict-avoiding codes of odd length and weight three
- Optimal 2-D \((n\times m,3,2,1)\)-optical orthogonal codes and related equi-difference conflict avoiding codes
- New Protocol Sequences for Random-Access Channels Without Feedback
- A tight asymptotic bound on the size of constant-weight conflict-avoiding codes
- The collision channel without feedback
- Information gathering in ad-hoc radio networks with tree topology
- 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
- Certain diagonal equations and conflict-avoiding codes of prime lengths
- On the cyclic order distribution and partitioning of linear cyclic codes
This page was built for publication: Constructions of protocol sequences for multiple access collision channel without feedback
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4307404)
