Pages that link to "Item:Q1073031"
From MaRDI portal
The following pages link to Explicit construction of exponential sized families of k-independent sets (Q1073031):
Displayed 34 items.
- Orientations making \(k\)-cycles cyclic (Q503634) (← links)
- \(t\)-CIS codes over \(\mathrm{GF}(p)\) and orthogonal arrays (Q516891) (← links)
- On the contact dimensions of graphs (Q579284) (← links)
- Coloring chains for compression with uncertain priors (Q668010) (← links)
- A Graham-Sloane type construction for \(s\)-surjective matrices (Q685994) (← links)
- Generalised cumulative arrays in secret sharing (Q851749) (← links)
- Roux-type constructions for covering arrays of strengths three and four (Q851777) (← links)
- Secret sharing schemes with partial broadcast channels (Q851779) (← links)
- Applications of coding theory to communication combinatorial problems (Q916665) (← links)
- A polynomial algorithm for constructing families of k-independent sets (Q920998) (← links)
- Explicit constructions for perfect hash families (Q1008968) (← links)
- On the maximum number of qualitative independent partitions (Q1121889) (← links)
- Application of coding theory to interconnection networks (Q1199457) (← links)
- Optimal linear perfect hash families (Q1269893) (← links)
- On the upper bound of the size of the \(r\)-cover-free families (Q1328402) (← links)
- Strong qualitative independence. (Q1422407) (← links)
- Perfect hash families: Probabilistic methods and explicit constructions (Q1586126) (← links)
- A hierarchical framework for recovery in compressive sensing (Q1693135) (← links)
- New constructions for IPP codes (Q1781000) (← links)
- On the capacity of Boolean graph formulæ (Q1805371) (← links)
- Strengthening hash families and compressive sensing (Q1932362) (← links)
- Explicit constructions of centrally symmetric \(k\)-neighborly polytopes and large strictly antipodal sets (Q1953061) (← links)
- Separable collusion-secure multimedia codes (Q2044131) (← links)
- Deterministic constructions of high-dimensional sets with small dispersion (Q2149098) (← links)
- Rényi 100, quantitative and qualitative (in)dependence (Q2236653) (← links)
- Arrays for combinatorial interaction testing: a review on constructive approaches (Q2303506) (← links)
- Improving two recursive constructions for covering arrays (Q2322060) (← links)
- Some baby-step giant-step algorithms for the low hamming weight discrete logarithm problem (Q2759107) (← links)
- Tropical Complexity, Sidon Sets, and Dynamic Programming (Q2832574) (← links)
- Linear Time Constructions of Some $$d$$-Restriction Problems (Q2947011) (← links)
- (Q4487082) (← links)
- Perfect Hash Families: Constructions and Existence (Q5295346) (← links)
- RESILIENT LKH: SECURE MULTICAST KEY DISTRIBUTION SCHEMES (Q5493902) (← links)
- Explicit constructions of perfect hash families from algebraic curves over finite fields (Q5929836) (← links)