The following pages link to A lower bound on packing density (Q1112098):
Displaying 19 items.
- Lattice packing and covering of convex bodies (Q741181) (← links)
- Packing superballs from codes and algebraic curves (Q928222) (← links)
- Dense packings from quadratic fields and codes (Q941315) (← links)
- On the packing densities of superballs and other bodies (Q1177421) (← links)
- An indexed set of density bounds on lattice packings (Q1345118) (← links)
- Compositions of sums of absolute powers (Q1900088) (← links)
- Constructive spherical codes near the Shannon bound (Q1934239) (← links)
- Exponential improvements for superball packing upper bounds (Q2308311) (← links)
- On the construction of dense lattices with a given automorphisms group (Q2372823) (← links)
- Dense packings from algebraic number fields and codes (Q2396759) (← links)
- A Gilbert-Varshamov-type bound for lattice packings (Q2431256) (← links)
- Random algebraic lattices and codes for wireless communications (Q2658391) (← links)
- A bound, and a conjecture, on the maximum lattice‐packing density of a superball (Q3139950) (← links)
- A note on lattices of rational functions (Q4005443) (← links)
- Constructive packings of cross polytopes (Q4009233) (← links)
- Lattice packing of nearly-euclidean balls in spaces of even dimension (Q4893694) (← links)
- On the density of cyclotomic lattices constructed from codes (Q5269116) (← links)
- A Note on Lattice Packings via Lattice Refinements (Q5374123) (← links)
- Lattice packings of cross‐polytopes from Reed–Solomon codes and Sidon sets (Q6051405) (← links)
