Pages that link to "Item:Q4307404"
From MaRDI portal
The following pages link to Constructions of protocol sequences for multiple access collision channel without feedback (Q4307404):
Displaying 17 items.
- Optimal strongly conflict-avoiding codes of even length and weight three (Q285257) (← links)
- New optimal constructions of conflict-avoiding codes of odd length and weight 3 (Q404933) (← links)
- Weighted maximum matchings and optimal equi-difference conflict-avoiding codes (Q498989) (← links)
- A new series of optimal tight conflict-avoiding codes of weight 3 (Q507480) (← links)
- Optimal conflict-avoiding codes of length \(n\equiv 0\pmod{16}\) and weight 3 (Q735031) (← links)
- Conflict-avoiding codes and cyclic triple systems (Q927474) (← links)
- Coding for a multiple access OR channel: A survey (Q947083) (← links)
- Necessary and sufficient conditions for tight equi-difference conflict-avoiding codes of weight three (Q1008958) (← links)
- Information gathering in ad-hoc radio networks with tree topology (Q1686117) (← links)
- On the cyclic order distribution and partitioning of linear cyclic codes (Q2042188) (← links)
- Optimal conflict-avoiding codes of odd length and weight three (Q2248642) (← links)
- Optimal 2-D \((n\times m,3,2,1)\)-optical orthogonal codes and related equi-difference conflict avoiding codes (Q2420468) (← links)
- Optimal equi-difference conflict-avoiding codes of odd length and weight three (Q2637325) (← links)
- A tight asymptotic bound on the size of constant-weight conflict-avoiding codes (Q2638410) (← links)
- Coding for a Multiple Access OR Channel: a Survey (Q3439269) (← links)
- Optimal Tight Equi‐Difference Conflict‐Avoiding Codes of Length <i>n</i> = 2<sup><i>k</i></sup> ± 1 and Weight 3 (Q4929280) (← links)
- Certain diagonal equations and conflict-avoiding codes of prime lengths (Q6063249) (← links)