Constructions of protocol sequences for multiple access collision channel without feedback

DOI10.1109/18.259673MaRDI QIDQ4307404zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

BCH codeconstant-weight codescollision channelprotocol sequencescyclically permutable codes

Mathematics Subject Classification ID

Cyclic codes (94B15) Channel models (including quantum) in information and communication theory (94A40)

Recommendations

• Publication:4731127
• The collision channel without feedback
• Some constructions of conflict-avoiding codes
• User-irrepressible sequences
• New Protocol Sequences for Random-Access Channels Without Feedback

Cited in

(22)

• Optimal tight equi-difference conflict-avoiding codes of length \(n = 2^{k} \pm 1\) and weight 3
• Optimal conflict-avoiding codes of length \(n\equiv 0\pmod{16}\) and weight 3
• Optimal 2-D \((n\times m,3,2,1)\)-optical orthogonal codes and related equi-difference conflict avoiding codes
• The collision channel without feedback
• Optimal strongly conflict-avoiding codes of even length and weight three
• Information gathering in ad-hoc radio networks with tree topology
• scientific article; zbMATH DE number 4116454 (Why is no real title available?)
• Optimal equi-difference conflict-avoiding codes of odd length and weight three
• Optimal conflict-avoiding codes of odd length and weight three
• User-irrepressible sequences
• Achieving Zero-Packet-Loss Throughput 1 for a Collision Channel Without Feedback and With Arbitrary Time Offsets
• New Protocol Sequences for Random-Access Channels Without Feedback
• On the cyclic order distribution and partitioning of linear cyclic codes
• Coding for a multiple access OR channel: A survey
• New optimal constructions of conflict-avoiding codes of odd length and weight 3
• Necessary and sufficient conditions for tight equi-difference conflict-avoiding codes of weight three
• Coding for a Multiple Access OR Channel: a Survey
• Weighted maximum matchings and optimal equi-difference conflict-avoiding codes
• A new series of optimal tight conflict-avoiding codes of weight 3
• A tight asymptotic bound on the size of constant-weight conflict-avoiding codes
• Certain diagonal equations and conflict-avoiding codes of prime lengths
• Conflict-avoiding codes and cyclic triple systems

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)