Conflict-avoiding codes and cyclic triple systems
From MaRDI portal
Recommendations
- Some constructions of conflict-avoiding codes
- scientific article; zbMATH DE number 4170840
- scientific article; zbMATH DE number 6500353
- Explicit constructions of optimal conflict-avoiding codes
- Optimal conflict-avoiding codes of odd length and weight three
- A class of optimal ternary cyclic codes and their duals
- Optimal Conflict-Avoiding Codes of Even Length and Weight 3
- A class of three-weight cyclic codes
- A class of three-weight cyclic codes
- Optimal strongly conflict-avoiding codes of even length and weight three
Cites work
- A class of codes for a T active users out of N multiple-access communication system
- Constructions of binary constant-weight cyclic codes and cyclically permutable codes
- Constructions of protocol sequences for multiple access collision channel without feedback
- Packet switching in a channel without feedback
- Perfect (d,k)-codes capable of correcting single peak-shifts
- The collision channel without feedback
Cited in
(17)- 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
- Twofold triple systems with cyclic 2‐intersecting Gray codes
- 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
- Classification of optimal conflict-avoiding codes of weights 6 and 7
- Optimal conflict-avoiding codes for three, four and five active users
- 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
- Optimal equi-difference conflict-avoiding codes of odd length and weight three
- scientific article; zbMATH DE number 6500353 (Why is no real title available?)
- Optimal 2-D \((n\times m,3,2,1)\)-optical orthogonal codes and related equi-difference conflict avoiding codes
- A tight asymptotic bound on the size of constant-weight conflict-avoiding codes
- Weighted maximum matchings and optimal equi-difference conflict-avoiding codes
- A new series of optimal tight conflict-avoiding codes of weight 3
- Strongly Conflict-Avoiding Codes
- Certain diagonal equations and conflict-avoiding codes of prime lengths
This page was built for publication: Conflict-avoiding codes and cyclic triple systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q927474)
