Pages that link to "Item:Q735031"
From MaRDI portal
The following pages link to Optimal conflict-avoiding codes of length \(n\equiv 0\pmod{16}\) and weight 3 (Q735031):
Displaying 21 items.
- Optimal equi-difference conflict-avoiding codes of weight four (Q256588) (← links)
- Optimal strongly conflict-avoiding codes of even length and weight three (Q285257) (← links)
- Optimal \((v,5,2,1)\) optical orthogonal codes of small \(v\) (Q371238) (← links)
- Constructions of optimal variable-weight OOCs via quadratic residues (Q382153) (← links)
- New optimal constructions of conflict-avoiding codes of odd length and weight 3 (Q404933) (← links)
- Further results on balanced \((n, \{3, 4 \}, \Lambda_a, 1)\)-OOCs (Q465279) (← 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)
- New results on optimal \((v,4,2,1)\) optical orthogonal codes (Q629878) (← links)
- Further results on optimal \((v,4,2,1)\)-OOCs (Q658057) (← links)
- Optimal conflict-avoiding codes for three, four and five active users (Q1752295) (← links)
- On optimal \((v,5,2,1)\) optical orthogonal codes (Q1952269) (← links)
- Optimal conflict-avoiding codes of odd length and weight three (Q2248642) (← links)
- Optimal optical orthogonal signature pattern codes with weight three and cross-correlation constraint one (Q2285780) (← 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)
- Some infinite classes of optimal \({(v,\{3,4\},1,Q)}\)-OOCs with \({Q\in\{(\frac{1}{3},\frac{2}{3}),(\frac{2}{3},\frac{1}{3})\}}\) (Q2637728) (← links)
- A tight asymptotic bound on the size of constant-weight conflict-avoiding codes (Q2638410) (← links)
- Bounds and Constructions on (<i>v</i>, 4, 3, 2) Optical Orthogonal Codes (Q2935199) (← 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)
