The following pages link to Linear intersecting codes (Q1072521):
Displaying 20 items.
- Yet another variation on minimal linear codes (Q259266) (← links)
- On the intersection of binary linear codes (Q328230) (← 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)
- Intersection of isomorphic linear codes (Q1374187) (← links)
- Intersecting codes and separating codes (Q1811095) (← links)
- The \(t\)-wise intersection and trellis of relative four-weight codes (Q2040344) (← links)
- Value functions and two classes of binary codes (Q2222958) (← links)
- Linear \(\ell \)-intersection pairs of codes and their applications (Q2285781) (← links)
- The separation of binary relative three-weight codes and its applications (Q2325297) (← links)
- On relative constant-weight codes (Q2339140) (← links)
- Variations on Minimal Linear Codes (Q3460456) (← links)
- Symbol-Intersecting Codes (Q3547566) (← 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)
- Strong blocking sets and minimal codes from expander graphs (Q6571606) (← links)
- Minimal codewords: an application of relative four-weight codes (Q6637066) (← links)
