Dense packings from quadratic fields and codes

JOURNAL OF COMBINATORIAL THEORY SERIES A

卷:115

Article

Xing, Chaoping

关键词: dense packings;    asymptotic bounds;    Minkowski bound;    best-known packings;    quadratic fields;   

DOI  :  10.1016/j.jcta.2007.12.005

来源: Elsevier

【 摘 要 】

In the present paper, we make use of the quadratic field Q(root-3) to construct dense packings in the Euclidean spaces. With the help from good error-correcting codes, we are able to produce several packings with the best-known densities. Furthermore, if we assume that the best upper bound in coding theory developed by Aaltonen, Ben-Haim and Litsyn could be achieved, then the Minkowski bound would be improved. (C) 2008 Elsevier Inc. All rights reserved.

【 授权许可】

Free