Optimal strongly conflict-avoiding codes of even length and weight three
From MaRDI portal
Abstract: Strongly conflict-avoiding codes (SCACs) are employed in a slot-asynchronous multiple-access collision channel without feedback to guarantee that each active user can send at least one packet successfully in the worst case within a fixed period of time. Assume all users are assigned distinct codewords, the number of codewords in an SCAC is equal to the number of potential users that can be supported. SCACs have different combinatorial structure compared with conflict-avoiding codes (CACs) due to additional collisions incurred by partially overlapped transmissions. In this paper, we establish upper bounds on the size of SCACs of even length and weight three. Furthermore, it is shown that some optimal CACs can be used to construct optimal SCACs of weight three.
Recommendations
Cites work
- A General Upper Bound on the Size of Constant-Weight Conflict-Avoiding Codes
- A tight asymptotic bound on the size of constant-weight conflict-avoiding codes
- Conflict-avoiding codes and cyclic triple systems
- Constant Weight Conflict-Avoiding Codes
- Construction and Applications of CRT Sequences
- Constructions of binary constant-weight cyclic codes and cyclically permutable codes
- Constructions of protocol sequences for multiple access collision channel without feedback
- Necessary and sufficient conditions for tight equi-difference conflict-avoiding codes of weight three
- New Protocol Sequences for Random-Access Channels Without Feedback
- On Conflict-Avoiding Codes of Length n=4m for Three Active Users
- Optimal Conflict-Avoiding Codes of Even Length and Weight 3
- Optimal conflict-avoiding codes of length \(n\equiv 0\pmod{16}\) and weight 3
- Optimal conflict-avoiding codes of odd length and weight three
- Optimal equi-difference conflict-avoiding codes of odd length and weight three
- Optimal tight equi-difference conflict-avoiding codes of length \(n = 2^{k} \pm 1\) and weight 3
- Shift-Invariant Protocol Sequences for the Collision Channel Without Feedback
- Strongly Conflict-Avoiding Codes
- The collision channel without feedback
Cited in
(6)- Necessary and sufficient conditions for tight equi-difference conflict-avoiding codes of weight three
- Strongly Conflict-Avoiding Codes
- On Conflict-Avoiding Codes of Length n=4m for Three Active Users
- Multichannel Conflict-Avoiding Codes of Weights Three and Four
- Optimal Conflict-Avoiding Codes of Even Length and Weight 3
- Conflict-avoiding codes and cyclic triple systems
This page was built for publication: Optimal strongly conflict-avoiding codes of even length and weight three
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q285257)
