Asymptotically dense spherical codes - Part I: Wrapped spherical codes

IEEE Transactions on Information Theory

Volumn 43, Issue 6, 1997, Pages 1774-1785

  Hamkins, Jon ^a,b   Zeger, Kenneth ^a,c  

^a IEEE   (United States)

^b CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

^c UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Asymptotic density; Laminated lattices; Packing; Source and channel coding; Spherical codes

Indexed keywords

COMMUNICATION CHANNELS (INFORMATION THEORY); ENCODING (SYMBOLS);

ASYMPTOTIC DENSITY; LAMINATED LATTICES; SPHERE PACKING; WRAPPED SPHERICAL CODES;

CODES (SYMBOLS);

EID: 0031268740     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.641544     Document Type: Article

References (50)

1. J. Hamkins and K. Zeger, "Asymptotically dense spherical codes - Part II: Laminated spherical codes," this issue, pp. 1786-1798.
2. J. Gao, L. D. Rudolph, and C. R. P. Hartmann, "Iteratively maximum likelihood decodable spherical codes and a method for their construction," IEEE Trans. Inform. Theory, vol. 34, pp. 480-485, May 1988.
3. J. K. Karlof, "Decoding spherical codes for the Gaussian channel," IEEE Trans. Inform. Theory, vol. 39, pp. 60-65, Jan. 1993.
4. J. Hamkins, "Design and analysis of spherical codes," Ph.D. dissertation, Univ. of Illinois at Urbana-Champaign, Sept. 1996.
5. J.-P. Adoul, C. Lamblin, and A. Leguyader, "Base-band speech coding at 2400 bps using spherical vector quantization," in IEEE Int. Conf. on Acoustics, Speech, and Signal Processing, 1984, pp. 1.12.1-1.12.4.
6. T. J. Aird and J. R. Rice, "Systematic search in high dimensional sets," SIAM J. Numer. Alg., vol. 14, pp. 296-312, 1977.
7. A. D. McLaren, "Optimal numerical integration on a sphere," Math. Comp., vol. 17, pp. 361-383, 1963.
8. T. W. Melnyk, O. Knop, and W. R. Smith, "Extremal arrangements of points and unit charges on a sphere: Equilibrium configurations revisited," Can. J. Chem., vol. 55, pp. 1745-1761, 1977.
9. J. T. Astola, "The Tietäväinen bound for spherical codes," Discr. Appl. Math., vol. 7, no. 1, pp. 17-21, 1984.
10. J. H. Conway and N. J. A. Sloane, Sphere Packings, Lattices, and Groups. New York: Springer-Verlag, 1993.
11. P. Delsarte, J. M. Goethals, and J. J. Seidel, "Spherical codes and designs," Geom. Dedicata, vol. 6, pp. 363-388, 1977.
12. T. Ericson and V. Zinoviev, "On spherical codes generating the kissing number in dimensions 8 and 24," Discr. Math., vols. 106/107, pp. 199-207, 1992.
13. _, "Spherical codes generated by binary partitionings of symmetric pointsets," IEEE Trans. Inform. Theory, vol. 41, pp. 107-129, Jan. 1995.
14. K. J. Nurmella, "Constructing spherical codes by global optimization methods," Helsinki Univ. of Technology, Otaniemi, Finland, Tech. Rep. 32, Feb. 1995.
15. N. J. A. Sloane, "Tables of sphere packings and spherical codes," IEEE Trans. Inform. Theory, vol. IT-27, pp. 327-338, May 1981.
16. A. Wyner, "Random packings and coverings of the unit n-sphere," Bell Syst. Tech. J., pp. 2111-2118, Nov. 1967.
17. G. A. Kabatyanskii and V. I. Levenšteǐn, "Bounds for packings on a sphere and in space," Probl. Pered. Inform., vol. 14, no. 1, pp. 3-25, 1978, English translation.
18. G. Lachaud and J. Stern, "Polynomial-time construction of codes ii," IEEE Trans. Inform. Theory, vol. 40, no. 4, pp. 1140-1146, 1994.
19. P. G. Boyvalenkov, D. P. Danev, and S. P. Bumova, "Upper bounds on the minimum distance of spherical codes," IEEE Trans. Inform. Theory, vol. 42, pp. 1576-1581, Sept. 1996.
20. T. H. Cormen, C. E. Leiserson, and R. L. Rivest, Introduction to Algorithms. New York: McGraw Hill, 1990.
21. C. A. Rogers, "The packing of equal spheres," P roc. London Math. Soc., vol. 8, pp. 609-620, 1958.
22. H. S. M. Coxeter, Twelve Geometric Essays. Carbondale, IL: Southern Illinois Univ. Press, 1968.
23. R. A. Rankin, "The closest packing of spherical caps in n dimensions," Proc. Glasgow Math. Assoc., vol. 2, pp. 139-144, 1955.
24. I. M. Yaglom, "Some results concerning distributions in n-dimensional space," Appendix to the Russian edition of Fejes Tóth's Lagerungen in der Ebene, auf der Kugel und in Raum, 1958.
25. L. Fejes Tóth, "Kugelunterdeckungen und Kugelúberdeckungen in Räumen konstanter Krümmung," Arch. Math., vol. 10, pp. 307-313, 1959.
26. A. Wyner, "Capabilities of bounded discrepancy decoding," Bell Syst. Tech. J., vol. 44, pp. 1061-1122, July/Aug. 1965.
27. M. Goldberg, "Packing of 19 equal circles on a sphere," Elem. Math., vol. 22, pp. 108-110, 1967.
28. A. A. El Gamal, L. A. Hemachandra, I. Shperling, and V. K. Wei, "Using simulated annealing to design good codes," IEEE Trans. Inform. Theory, vol. IT-33, pp. 116-123, Jan. 1987.
29. A. G. Burr, "Spherical codes for m-ary code shift keying," in 2nd IEE Nat. Conf.on Telecommunications, Apr. 1989, pp. 67-72.
30. Z. Yu, "On spherical codes and coded modulation," Master's thesis, Dept. Elec. Eng., Univ. of Hawaii at Manoa, 1992.
31. T. Ericson and V. Zinoviev, "Spherical codes from the hexagonal lattice," in Communications and Cryptography, Two Sides of One Tapestry, R. E. Blahut, D. J. Costello, Jr., U. Maurer, and T. Mittelholzer, Eds. Dordrecht, The Netherlands: Kluwer, 1994, pp. 109-114.
32. W.-Y. Hsiang, "Sphere packings and spherical geometry-Kepler's conjecture and beyond," Center for Pure and Applied Mathematics, University of California, Berkeley, July 1991, preprint.
33. _, "On the sphere packing problem and the proof of Kepler's conjecture," Int. J. Math., vol. 4, no. 5, pp. 739-831, 1993.
34. T. C. Hales, "The status of the Kepler conjecture," Math. Intelligenger, vol. 16, no. 3, pp. 47-58, 1994.
35. W.-Y. Hsiang, "A rejoinder to Hales's article," Math. Intelligencer, vol. 17, no. 1, pp. 35-42, 1995.
36. K. Böröczky, "Packing of spheres in spaces of constant curvature," Acta Math. Acad. Scient. Hung., vol. 32, pp. 243-261, 1978.
37. J. H. Conway and N. J. A. Sloane, "A lower bound on the average error of vector quantizers," IEEE Trans. Inform. Theory, vol. IT-31, pp. 106-109, Jan. 1985.
38. 3," Mathematika, vol. 33, pp. 137-147, 1986.
39. J.-P. Adoul and M. Barth, "Nearest neighbor algorithm for spherical codes from the Leech lattice," IEEE Trans. Inform. Theory, vol. 34, pp. 1188-1202, Sept. 1988.
40. D. Slepian, "Permutation modulation," Proc. IEEE, vol. 53, pp. 228-236, Mar. 1965.
41. E. M. Biglieri and M. Elia, "Optimum permutation modulation codes and their asymptotic performance," IEEE Trans. Inform. Theory, vol. 22, pp. 751-753, Nov. 1976.
42. D. A. Kottwitz, "The densest packing of equal circles on a sphere," Acta Cryst., vol. A47, pp. 158-165, 1991.
43. M. Goldberg, "Packing of 18 equal circles on a sphere," Elem. Math., vol. 20, pp. 59-61, 1965.
44. _, "An improved packing of 33 equal circles on a sphere," Elem. Math., vol. 22, pp. 110-112, 1967.
45. E. Székely, "Sur le probléme de Tammes," Ann. Univ. Sci. Budapest. Eötvös, Sect. Math., vol. 17, pp. 157-175, 1974.
46. J. Gao, "Iteratively maximum likelihood decodable spherical codes," Ph.D. dissertation, Syracuse Univ., Syracuse, NY, Dec. 1984.
47. A. Vardy, "A new sphere packing in 20 dimensions," Invent. Math., vol. 121, pp. 119-133, July 1995.
48. J. H. Conway and N. J. A. Sloane, "The antipode construction for sphere packings," Invent. Math., vol. 123, pp. 309-313, 1995.
49. J. Hamkins and K. Zeger, "Asymptotically optimal spherical codes," in Proc. IEEE Conf. on Information Science and Systems, Mar. 1995, pp. 52-57.
50. _, "Asymptotically optimal spherical codes," in IEEE Int. Symp. on Information Theory, Sept. 1995, p. 184.