Constructions of protocol sequences for multiple access collision channel without feedback

DOI10.1109/18.259673zbMath0799.94005MaRDI QIDQ4307404

István Vajda, László Györfi

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

zbMATH Keywords

BCH code; constant-weight codes; collision channel; protocol sequences; cyclically permutable codes

Mathematics Subject Classification ID

94B15: Cyclic codes

94A40: Channel models (including quantum) in information and communication theory

Related Items

Optimal Tight Equi‐Difference Conflict‐Avoiding Codes of Length n = 2^k ± 1 and Weight 3, Certain diagonal equations and conflict-avoiding codes of prime lengths, Optimal strongly conflict-avoiding codes of even length and weight three, New optimal constructions of conflict-avoiding codes of odd length and weight 3, Weighted maximum matchings and optimal equi-difference conflict-avoiding codes, A new series of optimal tight conflict-avoiding codes of weight 3, Optimal conflict-avoiding codes of length \(n\equiv 0\pmod{16}\) and weight 3, Conflict-avoiding codes and cyclic triple systems, Coding for a multiple access OR channel: A survey, Necessary and sufficient conditions for tight equi-difference conflict-avoiding codes of weight three, Information gathering in ad-hoc radio networks with tree topology, On the cyclic order distribution and partitioning of linear cyclic codes, Optimal 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, 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, Coding for a Multiple Access OR Channel: a Survey