Pages that link to "Item:Q644316"
From MaRDI portal
The following pages link to Some new distance-4 constant weight codes (Q644316):
Displaying 13 items.
- On the number of matroids (Q313452) (← links)
- Optimal binary constant weight codes and affine linear groups over finite fields (Q1999901) (← links)
- The edge-connectivity of token graphs (Q2045395) (← links)
- Matroids are not Ehrhart positive (Q2136552) (← links)
- Large sets of \(t\)-designs over finite fields exist for all \(t\) (Q2153752) (← links)
- New explicit binary constant weight codes from Reed-Solomon codes (Q2363317) (← links)
- EXISTENCE OF -ANALOGS OF STEINER SYSTEMS (Q2971026) (← links)
- Independence and matching numbers of some token graphs (Q5109075) (← links)
- A distributed computing perspective of unconditionally secure information transmission in Russian cards problems (Q5918638) (← links)
- A distributed computing perspective of unconditionally secure information transmission in Russian cards problems (Q5925684) (← links)
- On the Connectivity of Token Graphs of Trees (Q6045414) (← links)
- Large cycles in generalized Johnson graphs (Q6084722) (← links)
- A new construction for \(q\)-ary constant weight codes (Q6156927) (← links)
