Packing superballs from codes and algebraic curves

DOI10.1007/s10114-007-1028-3zbMath1156.52011OpenAlexW2040017473MaRDI QIDQ928222

Li Liu, Xing, Chaoping

Publication date: 11 June 2008

Published in: Acta Mathematica Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10114-007-1028-3

zbMATH Keywords

densitypackingalgebraic curvescodes

Mathematics Subject Classification ID

Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Lattice packing and covering (number-theoretic aspects) (11H31) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)

Related Items (2)

Practical stochastic uniform input-to-state stability of perturbed triangular systems ⋮ Exponential improvements for superball packing upper bounds

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Number of points of an algebraic curve
• A lower bound on packing density
• Multiplicative lattices in global fields
• Modular curves, Shimura curves, and Goppa codes, better than Varshamov-Gilbert bound
• An improvement to the Minkowski‐Hiawka bound for packing superballs
• Low-dimensional lattices. VI. Voronoi reduction of three-dimensional lattices

This page was built for publication: Packing superballs from codes and algebraic curves