Spherical Codes Generated by Binary Partitions of Symmetric Pointsets

IEEE Transactions on Information Theory

Volumn 41, Issue 1, 1995, Pages 107-129

  Ericson, Thomas ^a   Zinoviev, Victor ^b  

^a LINKÖPING INSTITUTE OF TECHNOLOGY   (Sweden)

^b INSTITUTE FOR INFORMATION TRANSMISSION PROBLEMS   (Russian Federation)

Author keywords

generalized code concatenation; set partitioning; Spherical codes

Indexed keywords

CODES (SYMBOLS); INFORMATION THEORY; SET THEORY;

BINARY PARTITIONS; CODE CONCATENATION; SET PARTITIONING; SPHERICAL CODES; SYMMETRIC POINTSETS;

BINARY CODES;

EID: 0029231566     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/18.370114     Document Type: Article

References (102)

1. E. Bannai and N. J. A. Sloane, “Uniqueness of certain spherical codes,” Canad. J. Math., vol. 33, pp. 437–449.
2. E. S. Barnes and G. E. Wall, “Some extreme forms defined in terms of Abelian groups,” J. Amer. Math. Soc., vol. 1, pp. 47–63, 1959.
3. T. Beth, D. Jungnickel, and H. Lenz, Design Theory. Zurich, Switzerland: B. I. Wissenschaftsverlag, Bibliographisches Institut, 1985.
4. E. Biglieri and M. Elia, “On the existence of group codes for the Gaussian channel,” IEEE Trans. Inform. Theory, vol. IT-18, pp. 399–402, May 1972.
5. E. Biglieri and M. Elia, “Cyclic-group codes for the Gaussian channel,” IEEE Trans. Inform. Theory, vol. IT-22, no. 5, pp. 624–629, Sept. 1976.
6. —, “Optimum permutation modulation codes and their asymptotic performance,” IEEE Trans. Inform. Theory, vol. IT-22, no. 6, pp. 751–753, Nov. 1976.
7. I. F. Blake, “Distance properties of group codes for the Gaussian channel,” SIAM J. Appl. Math., vol. 23, no. 3, 1972.
8. —, “Codes over certain rings,” Inform. Contr., vol. 20, pp. 396–404, May 1972.
9. I. F. Blake, “Configuration matrices for group codes,” IEEE Trans. on Inform. Theory, vol. IT-20, pp. 95–100, Jan. 1974.
10. —, “Permutation codes for discrete channels,” IEEE Trans. Inform. Theory, vol. IT-20, pp. 138–140, Jan. 1974.
11. —, “Codes over integers residue rings,” Inform. Contr., vol. 29, pp. 295–300, 1975.
12. E. L. Blokh and V. V. Zyablov, Generalized Concatenated Codes. Moscow, USSR: Svyaz, 1976 (in Russian).
13. K. Böröczky, “Packing of spheres in spaces of constant curvature,” Acta Math. Sci. Hungaricae, vol. 32, pp. 243–261, 1978.
14. P. J. Boyvalenkov and S. M. Dodunekov, “Some new bounds on the kissing numbers,” in Proc. 6th Joint Swedish-Russian Workshop on Information Theory (Mölle, Sweden, 1993), pp. 389–393.
15. A. E. Brouwer, J. B. Shearer, N. J. A. Sloane, and W. D. Smith, “A new table of constant weight codes,” IEEE Trans. Inform. Theory, vol. IT-21, no. 6, pp. 1334–1380, 1974.
16. A. R. Calderbank, P. J. Cameron, M. Kantor, and J. J. Seidel, Orthogonal/Symplectic Geometry (Kerdock codes over Z2 and Z4, and Extraspecial 2-Groups), preprint, 1994.
17. P. J. Cameron, J.-M. Goethals, and J. J. Seidel, “Strongly regular graphs having strongly regular subconstituents,” J. Algebra, vol. 43, pp. 257–280, 1978.
18. C. Chabauty, “Resultat sur l'empilement de calottes egalessur une perisphere de Rn et correction a un travail anterieur,” C.R.A.S, vol. 236, pp. 1462–1464, 1953.
19. B. W. Clare and D. L. Kepert, “The closest packing of equal circles on asphere,” Proc. Roy. Soc. Land., vol. 405, pp. 329–344, 1986.
20. J. H. Conway and N. J. A. Sloane, Sphere Packings, Lattices and Groups, 2nd ed. New York: Springer-Verlag, 1993.
21. H. S. M. Coxeter, “Discrete groups generated by reflections,” Annal. Math., vol. 35, pp. 588–621, 1934.
22. H. S. M. Coxeter and J. A. Todd, “An extreme duodenary form,” Canad. J. Math., vol. 5, pp. 384–392, 1953.
23. H. S. M. Coxeter, “The problem of packing a number of equal nonoverlapping circles on a sphere,” Trans. N. Y. Acad. Sci. Ser. II, vol. 24, pp. 320–331, 1962.
24. —, “An upper bound for the number of equal nonoverlapping spheres that can touch another of the same size,” in Proc. Symp. on Pure Mathematics, vol. VII, 1963, pp. 53–72. Reprinted in H. S. M. Coxeter, Twelve Geometric Essays. Carbondale, IL: Southern Illinois Univ. Press.
25. —, Regular Polytopes, 3rd ed. New York: Dover, 1973.
26. L. Danzer, “Endliche Punktmengen auf der 2-Sphäre mit möglichst großem Minimalabstand,” Habilitationsschrift, Universität Göttingen (PhD. dissertation, Univ. of Göttingen), 1965.
27. H. Davenport and G. Hajos, Aufgabe 35, Matematikai Lapok, vol. 58, no. 2, 1951.
28. P. Delsarte, “Bounds for unrestricted codes by linear programming,” Philips Res. Rep., vol. 27, pp. 272–289, 1972.
29. P. Delsarte, J. M. Goethals, and J. J. Seidel, “Bounds for systems of lines and jacobi polynomials,” Philips Res. Rep., vol. 30, pp. 91–105, 1975.
30. P. Delsarte, J. M. Goethals, and J. J. Seidel, “Spherical codes and designs,” Geometriae Dedicata, vol. 6, pp. 363–388, 1977.
31. D. Djokovic and I. F. Blake, “An optimization problem for unitary and orthogonal representations of finite groups,” Trans. Amer. Math. Soc., vol. 164, 1972.
32. S. M. Dodunekov, V. A. Zinoviev, and Th. Ericson, “Concatenated method of construction of spherical codes in n-dimensional Euclidean space,” Probl. Inform. Transm., vol. 27, no. 1, pp. 34–38, 1991.
33. C. P. Downey and J. K. Karlof, “On the existence of [M, n] group codes for the Gaussian channel with M and n odd,” IEEE Trans. Inform. Theory, vol. IT-23, pp. 500–503, July 1977.
34. C. P. Downey and J. K. Karlof, “Optimal [M, 3] group codes for the Gaussian channel,” IEEE Trans. Inform. Theory, vol. IT-24, pp. 760–761, Nov. 1978.
35. I. I. Dumer, V. A. Zinoviev and V. V. Zyablov, “Cascade decoding with respect to minimal generalized distance,” Probl. Contr. Inform. Theory, vol. 10, no. 1, pp. 1–17, 1982.
36. G. Einarsson, “Performance of polyphase signals on a gaussian channel,” Ericsson Tech., no. 4, pp. 411–433, 1967.
37. —, “Polyphase coding for a Gaussian channel,” Ericsson Tech., no. 2, pp. 75–130, 1967.
38. Th. Ericson, “Bounds on the size of a code,” in Lecture Notes in Control and Inform. Sciences, vol. 128, M. Thoma and A. Wyner, Eds. New York: Springer-Verlag, 1989, pp. 45–72.
39. —, “Permutation codes,” INRIA Rep. 2109, Nov. 1993.
40. Th. Ericson and V. A. Zinoviev, “Spherical codes and binary partitions of finite pointsets on the real line,” in Proc. 5th Joint Soviet-Swedish Workshop on Information Theory (Moscow, USSR, 1991), pp. 57–60.
41. —, “Concatenated spherical codes,” in EUROCODE 90, Int. Symp. on Coding Theory and Applications (Udine, Italy), Lecture Notes in Computer Science, vol. 514. New York: Springer-Verlag, 1991, pp. 2–5.
42. —, “Binary partitions of symmetric pointsets,” in 5th Tirrenia Int. Conf. on Information Theory (Tirrenia, Italy, 1991), Coded Modulation and Bandwidth-Efficient Transmission, E. Biglieri and M. Luise, Eds. Amsterdam, The Netherlands: Elsevier, 1992, pp. 249–259.
43. —, “Concatenated spherical codes in Euclidean space,” in 5th Tirrenia Int. Conf. on Information Theory (Tirrenia, Italy, 1991), Coded Modulation and Bandwidth-Efficient Transmission, E. Biglieri and M. Luise, Eds. Amsterdam, The Netherlands: Elsevier, 1992, pp. 261–268.
44. —, “New packings on Euclidean sphere for finite dimensions,” Probl. Inform. Transmission, vol. 28, no. 2, pp. 47–53, 1992.
45. —, “On spherical codes generating the kissing number in dimensions 8 and 24,” Discrete Math., vols. 106/107, pp. 199–207, 1992.
46. —, “Ternary spherical codes by balanced mappings of constant weight binary codes,” in Proc. 6th Joint Swedish-Russian Workshop on Information Theory (Mölle, Sweden, 1993), pp. 140–144, 1993.
47. —, “Spherical codes from unsymmetric alphabets,” in Proc. 15th Benelux Symp. on Information Theory (Louvain-la-Neuve, May 30–31, 1994).
48. L. Fejes Tóth, Lagerungen in der Ebene, auf der Kugel und im Raum. Berlin, Germany: Springer, 1953.
49. G. D. Forney, Jr., “Generalized minimum distance decoding,” IEEE Trans. Inform. Theory, IT-12, pp. 125–131, 1966.
50. —, “Concatenated codes,” MIT Research Monograph 37. Cambridge, MA: MIT Press, 1966.
51. G. D. Forney, Jr., R. G. Gallager, G. R. Lang, F. M. Longstaff, and S. U. Quershi, “Efficient modulation for band-limited channels,” IEEE J. Selected Areas Commun., vol. SAC-2, pp. 632–647, 1984.
52. V. V. Ginzburg, “Multidimensional signals for a continuous channel,” Probl. Inform. Transm., vol. 20, no. 1, pp. 28–46, 1984.
53. T. Gosset, “On the regular and semi-regular figures in space of n dimensions,” Messenger Math., vol. 29, pp. 43–48, 1900.
54. A. R. Hommons Jr., P. V. Kumar, A. R. Calderbank, N. J. A. Sloane, and P. Solé, “The Z4 -linearity of Kerdock, Preparata, Goethals and related codes,” IEEE Trans. Inform. Theory, vol. 40, no. 2, pp. 301–319, Mar. 1994.
55. R. Hoppe, “Bemerkung der Reduction,” Archiv Math. Phys. (Grunert), vol. 56, pp. 307–312, 1874.
56. H. Imai and S. Hirakawa, “A new multilevel coding method using error-correcting codes,” IEEE Trans. Inform. Theory, vol. IT-23, pp. 371–377, 1977.
57. I. Ingemarsson, “Commutative group codes for the Gaussian channel,” IEEE Trans. Inform. Theory, vol. IT-19, pp. 215–219, Mar. 1973.
58. —, “Group codes for the Gaussian channel,” in Lecture Notes in Control and Inform. Sciences, vol. 128, M. Thoma and A. Wyner, Eds. New York: Springerhy-Verlag, 1989, pp. 73–108.
59. —, “Optimized permutation modulation,” IEEE Trans. Inform. Theory, vol. 36, no. 5, pp. 1098–1100, Sept. 1990.
60. S. M. Johnson, “A new upper bound for error-correcting codes,” IEEE Trans. Inform. Theory, vol. IT-8, pp. 203–207, 1962.
61. G. A. Kabatiansky and V. I. Levenshtein, “Bounds for packings on a sphere and in space,” Probl. Inform. Transm., vol. 14, no. 1, pp. 1–17, 1978.
62. J. K. Karlof, “Permutation codes for the Gaussian channel,” IEEE Trans. Inform. Theory, vol. 35, no. 4, pp. 726–732, July 1989.
63. J. K. Karlof and C. P. Downey, “Odd group codes for the Gaussian channel,” SIAM J. Appl. Math., vol. 34, pp. 715–716, 1978.
64. A. M. Kerdock, “A class of low-rate nonlinear codes,” Inform. Contr., vol. 20, pp. 182–187, 1972.
65. J. Lahtonen and T. Mittelholzer, “Group codes from finite reflection groups,” IEEE Trans. Inform. Theory, to appear.
66. H. J. Landau, “How does a porcupine separate its quills?,” IEEE Trans. Inform. Theory, vol. IT-17, no. 2, pp. 157–161, Mar. 1971.
67. J. Leech, “The problem of the thirteen spheres,” Math. Gaz., vol. 40, pp. 22–23, 1956.
68. —, “Some sphere packings in higher space,” Canad. J. Math., vol. 16, pp. 657–682, 1964.
69. —, “Notes on sphere packings,” Canad. J. Math., vol. 19, pp. 251–267, 1967.
70. J. Leech and N. J. A. Sloane, “Sphere packings and error-correcting codes,” Canad. J. Math., vol. 23, no. 4, pp. 718–745, 1971.
71. P. W. H. Lemmens and J. J. Seidel, “Equiangular lines,” J. Algebra, vol. 24, pp. 494–512, 1973.
72. V. I. Levenshtein, “On bounds for packings in n-dimensional Euclidean space,” Sov. Math.- Dokl., vol. 20, no. 2, pp. 417–421, 1979.
73. —, “Bounds for packings of metric spaces and some of their applications,” Problemy Kibernetiki, vol. 40. Moscow, USSR: Nauka, 1983, pp. 43–110 (in Russian).
74. —, “Designs as maximum codes in polynomial metric spaces,” Acta Appl. Mathematicae, vol. 29, no. 99, pp. 11–82, 1992.
75. S. P. Lloyd, “Hamming associattion schemes and codes on spheres,” SIAM J. Math. Anal., vol. 11, no. 3, pp. 488–505, May 1980.
76. A. L. MacKay, “The packing of three-dimensional spheres on the surface of a four-dimensional hypersphere,” J. Phys., vol. A13, pp. 3373–3379, 1980.
77. F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes. Amsterdam, The Netherlands: North-Holland, 1977.
78. M. Nilsson, “Linear block codes over rings for phase shift keying,” in Linköping Studies in Science and Technology (Dissertations), no. 321, Linköping, Sweden, 1993.
79. A. M. Odlyzko and N. J. A. Sloane, “New upper bounds on the number of unit spheres that can touch a unit sphere in n dimensions,” J. Combin. Theory, vol. A 26, pp. 210–214, 1979.
80. R. Ottosson, “Performance of phase- and amplitude-modulated signals on a Gaussian channel,” Ericsson Tech., no. 3, pp. 153–198, 1969.
81. —, “Group codes for phase- and amplitude-modulated signals on a Gaussian channel,” IEEE Trans. Inform. Theory, vol. IT-17, pp. 315–321, May 1971.
82. P. Piret, “Bounds for codes over the unit circle,” IEEE Trans. Inform. Theory, vol. IT-32, no. 6, pp. 760–767, 1986.
83. S. L. Portnoi, “Characterisations of modulation and encoding systems as concatenated codes,” Probl. Inform. Transm., vol. 21, no. 3, pp. 14–27, 1985.
84. R. A. Rankin, “The closest packing of spherical caps in n dimensions,” Proc. Glascow Math. Assoc., vol. 2, pp. 139–144, 1955.
85. R. M. Robinson, “Arrangements of 24 points on a sphere,” Math. Ann., vol. 144, pp. 17–48, 1961.
86. S. I. Sayegh, “A class of optimum block codes in signal space,” IEEE Trans. Commun., vol. COM-34, no. 10, pp. 1043–1045, 1986.
87. K. Schütte and B. L. van der Waerden, “Auf welcher Kugel haben 5, 6, 7, oder 8 Punkte mit Mindestabstand Eins Platz?,” Math. Ann., vol. 123, pp. 96–124, 1951.
88. C. E. Shannon, “Probability of error for optimal codes in a Gaussian channel,” Bell Syst. Tech. J., vol. 38, pp. 611–656, 1959.
89. V. M. Sidelnikov, “On the densest packing of balls on the surface of an n-dimensional Euclidean sphere and the number of binary code vectors with a given code distance,” Soviet Math.-Dokl., vol. 14, pp. 1851–1855, 1973.
90. D. Slepian, “Permutatiom modulation,” Proc. IEEE, vol. 53, no. 3, pp. 228–236, Mar. 1965.
91. —, “Group codes for the Gaussian channel,” Bell Syst. Tech. J., vol. 47, no. 4, pp. 575–602, Apr. 1968.
92. N. J. A. Sloane, “Tables of sphere packings and spherical codes,” IEEE Trans. Inform. Theory, vol. IT-27, pp. 327–338, 1981.
93. —, “Recent bounds for codes, sphere packing and related problems obtained by linear programming and other methods,” Contemp. Math., vol. 9, pp. 153–185, 1982.
94. G. Ungerboeck, “Channel coding with multilevel/phase signals,” IEEE Trans. Inform. Theory, vol. IT-28, no. 1, pp. 55–67, Jan. 1982.
95. A. D. Wyner, “Capabilities of bounded discrepancy decoding,” Bell Syst. Tech. J., vol. 44, pp. 1061–1122, 1965.
96. L. H. Zetterberg, “A class of codes for polyphase signals on a bandlimited Gaussian channel,” IEEE Trans. Inform. Theory, vol. IT-11, pp. 385–395, July 1965.
97. —, “Detection of a class of coded and phase-modulated signals,” IEEE Trans. Inform. Theory, vol. IT-12, pp. 153–161, Apr. 1966.
98. L. H. Zetterberg and H. Brändsträm, “Codes for the combined phase and amplitude modulated signals in a four-dimensional space,” IEEE Trans. Commun., vol. COM-25, pp. 943–950, Sept. 1977.
99. V. A. Zinoviev, “Generalized concatenated codes,” Probl. Inform. Transm., vol. 12, no. 1, pp. 5–15, 1976.
100. V. A. Zinoviev and V. V. Zyablov, “Decoding of nonlinear generalized concatenated codes,” Probl. Inform. Transm., vol. 14, no. 2, pp. 46–52, 1978.
101. V. A. Zinoviev, S. N. Litsyn, and S. L. Portnoi, “Cascade codes in Euclidean space,” Probl. Inform. Transm., vol. 25, no. 3, pp. 62–75, 1989.
102. V. V. Zyablov and S. L. Portnoi, “On one modulation coding system for a Gaussian channel,” Probl. Inform. Transm., vol. 23, no. 3, pp. 18–26, 1987.