Pages that link to "Item:Q5953384"
From MaRDI portal
The following pages link to Linear codes with exponentially many light vectors (Q5953384):
Displaying 6 items.
- On closest pair in Euclidean metric: monochromatic is as hard as bichromatic (Q2221003) (← links)
- On the lattice Hadwiger number of superballs and some other bodies (Q2230921) (← links)
- Lattices with exponentially large kissing numbers (Q2420496) (← links)
- On the Number of Circuits in Regular Matroids (with Connections to Lattices and Codes) (Q5009328) (← links)
- On Closest Pair in Euclidean Metric: Monochromatic is as Hard as Bichromatic (Q5090390) (← links)
- One more proof of the first linear programming bound for binary codes and two conjectures (Q6050274) (← links)
