Pages that link to "Item:Q4850288"
From MaRDI portal
The following pages link to Intersecting codes and independent families (Q4850288):
Displaying 19 items.
- Trellis complexity and pseudoredundancy of relative two-weight codes (Q260089) (← links)
- The fullrank value function (Q306342) (← links)
- On the intersection of binary linear codes (Q328230) (← links)
- The maximum number of minimal codewords in an \([n,k]\)-code (Q389190) (← links)
- Structures and lower bounds for binary covering arrays (Q449145) (← links)
- The \(t\)-wise intersection of relative two-weight codes (Q477160) (← links)
- Separating codes and a new combinatorial search model (Q619509) (← links)
- An application of coding theory to estimating Davenport constants (Q634137) (← links)
- On the constructions of highly nonlinear zigzag functions and unbiased functions (Q1603459) (← links)
- Intersecting codes and separating codes (Q1811095) (← links)
- The \(t\)-wise intersection and trellis of relative four-weight codes (Q2040344) (← links)
- Arrays for combinatorial interaction testing: a review on constructive approaches (Q2303506) (← links)
- The separation of binary relative three-weight codes and its applications (Q2325297) (← links)
- (Q2741412) (← links)
- On the state of strength-three covering arrays (Q3150159) (← links)
- Separation and Witnesses (Q5322994) (← links)
- Small Strong Blocking Sets by Concatenation (Q5883273) (← links)
- A note on (3,1) and (3,2) separating systems and bound for (3,1) separating system (Q6059063) (← links)
- On the lower bound for the length of minimal codes (Q6080135) (← links)
