Skip to main content
SpringerLink
Log in

Constructive Kissing Numbers in High-Dimensional Spaces

  • Published:
Journal of Systems Science and Complexity Aims and scope Submit manuscript

Abstract

In the present paper, we focus on constructive spherical codes. By employing algebraic geometry codes, we give an explicit construction of spherical code sequences. By making use of the idea involved in the proof of the Gilbert-Varshamov bound in coding theory, we construct a spherical code sequence in exponential time which meets the best-known asymptotic bound by Shamsiev and Wyner.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. J. H. Conway N. J. A. Sloane (1999) Sphere Packings, Lattice and Groups (Third Edition) Springer-Verlag New-York

    Google Scholar 

  2. G. A. Kabatiansky V. I. Levenshtein (1978) ArticleTitleBounds for packings on sphere and in space Problemy Peredachi Informatsii 14 IssueID1 3–25

    Google Scholar 

  3. E. A. Shamsiev (1959) ArticleTitleProbability of error for optimal codes in a Gaussian channel Bell System Technical Journal 38 611–656

    Google Scholar 

  4. A. D. Wyner (1965) ArticleTitleCapabilities of bounded discrepancy decoding Bell System Technical Journal 44 1061–1122

    Google Scholar 

  5. H. Niederreiter and C. P. Xing, Rational Points on Curves over Finite Fields–Theory and Applications, Cambridge University Press, 2002, LMS 285.

  6. M. A. Tsfasman S. G. Vlăduţ (1991) Algebraic-Geometric Codes Kluwer Holland

    Google Scholar 

  7. Y. Ihara (1982) ArticleTitleSome remarks on the number of rational points of algebraic curves over finite fields J. Fac. Sci. Univ. Tokyo 28 721–724

    Google Scholar 

  8. M. A. Tsfasman S. G. Vlăduţ T. Zink (1982) ArticleTitleModular curves, Shimura curves, and Goppa codes better than the Varshamov-Gilbert bound Math. Nach. 104 13–28

    Google Scholar 

  9. A. Gacia H. Stichtenoth (1995) ArticleTitleA tower of Artin-Schreier extensions of function fields attaining the Drinfeld-Vladut bound Invent. Math. 121 211–222 Occurrence Handle10.1007/BF01884295

    Article  Google Scholar 

  10. S. Ling C. P. Xing (2004) Coding Theory–A First Course Cambridge University Press Cambridge

    Google Scholar 

  11. S. N. Litsyn M. A. Tsfasman (1987) ArticleTitleConstructive high-dimensional sphere packings Duke. Math. J. 54 147–161 Occurrence Handle10.1215/S0012-7094-87-05411-1

    Article  Google Scholar 

  12. J. A. Rush N. J. A. Sloane (1987) ArticleTitleAn improvement to the Minkowski-Hlawka bound for packing superballs Mathematika 34 8–18 Occurrence Handle10.1112/S0025579300013231

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Number 81, P.O.Box 5102, Beijing, 100094, China

    Lanju Xu

Authors
  1. Lanju Xu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Lanju Xu.

Additional information

Submitted by Prof. Chaoping XING.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Xu, L. Constructive Kissing Numbers in High-Dimensional Spaces. Jrl Syst Sci & Complex 20, 30–40 (2007). https://doi.org/10.1007/s11424-007-9002-9

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11424-007-9002-9

Keywords

Search

Navigation