Pages that link to "Item:Q3315431"
From MaRDI portal
The following pages link to Some results on the existence of binary linear codes (Corresp.) (Q3315431):
Displaying 9 items.
- On the intersection of binary linear codes (Q328230) (← links)
- Every binary code can be realized by convex sets (Q1637597) (← links)
- Strengthening the Gilbert-Varshamov bound (Q1973922) (← links)
- The clique distribution in powers of hypercubes (Q2235258) (← links)
- Sharpening the Gilbert-Varshamov bound in the finite case (Q2766135) (← links)
- The nonexistence of certain binary linear codes (Q3489933) (← links)
- (Q4591444) (← links)
- All Binary Linear Codes That Are Invariant Under <inline-formula> <tex-math notation="LaTeX">${\mathrm{PSL}}_2(n)$ </tex-math> </inline-formula> (Q4682876) (← links)
- One more proof of the first linear programming bound for binary codes and two conjectures (Q6050274) (← links)