Dense packings from quadratic fields and codes

DOI10.1016/j.jcta.2007.12.005zbMath1162.52012OpenAlexW2008106344MaRDI QIDQ941315

Xing, Chaoping

Publication date: 4 September 2008

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcta.2007.12.005

zbMATH Keywords

quadratic fieldsasymptotic boundsMinkowski boundbest-known packingsdense packings

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Quadratic extensions (11R11) Lattices and convex bodies (number-theoretic aspects) (11H06) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Theory of error-correcting codes and error-detecting codes (94B99)

Related Items

Dense packings from algebraic number fields and codes ⋮ Improvement on asymptotic density of packing families derived from multiplicative lattices

Cites Work

• A new upper bound on the rate of non-binary codes
• A new upper bound on nonbinary block codes
• Constructive high-dimensional sphere packings
• A lower bound on packing density
• The binary self-dual codes of length up to 32: A revised enumeration
• Sphere packings. (Edited by John Talbot)
• An improvement to the Minkowski‐Hiawka bound for packing superballs
• There is no (24, 12, 10) self-dual quaternary code
• Low-dimensional lattices. VI. Voronoi reduction of three-dimensional lattices
• New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item