Pages that link to "Item:Q375844"
From MaRDI portal
The following pages link to \((2,1)\)-separating systems beyond the probabilistic bound (Q375844):
Displaying 10 items.
- Yet another variation on minimal linear codes (Q259266) (← links)
- Bilinear complexity of algebras and the Chudnovsky-Chudnovsky interpolation method (Q432769) (← links)
- Gaps between prime numbers and tensor rank of multiplication in finite fields (Q1727373) (← links)
- On general position sets in Cartesian products (Q2041227) (← links)
- Separable collusion-secure multimedia codes (Q2044131) (← links)
- Trisymmetric multiplication formulae in finite fields (Q2232213) (← links)
- Too Acute to Be True: The Story of Acute Sets (Q4972078) (← links)
- On the tensor rank of multiplication in finite extensions of finite fields and related issues in algebraic geometry (Q4992045) (← links)
- General position sets in two families of Cartesian product graphs (Q6040049) (← links)
- Improved upper bounds for the rate of separating and completely separating codes (Q6173461) (← links)
