The following pages link to Linear intersecting codes (Q1072521):
Displaying 6 items.
- Yet another variation on minimal linear codes (Q259266) (← links)
- \((2,1)\)-separating systems beyond the probabilistic bound (Q375844) (← links)
- The maximum number of minimal codewords in an \([n,k]\)-code (Q389190) (← links)
- The \(t\)-wise intersection of relative two-weight codes (Q477160) (← links)
- Multi-wise and constrained fully weighted Davenport constants and interactions with coding theory (Q491979) (← links)
- An application of coding theory to estimating Davenport constants (Q634137) (← links)
