Some constructions of superimposed codes in Euclidean spaces

Discrete Applied Mathematics

Volumn 128, Issue 1 SPEC., 2003, Pages 85-101

  Danev, Danyo ^a  

^a LINKÖPING UNIVERSITY   (Sweden)

Author keywords

Euclidean channel; Multiple access communications; Spherical codes; Superimposed codes

Indexed keywords

GEOMETRY; OPTIMAL SYSTEMS;

EUCLIDEAN; EUCLIDEAN SPACES; MULTIPLE ACCESS COMMUNICATIONS; SIMPLEX CODES; SPHERICAL CODES; SUPERIMPOSED CODES;

CODES (SYMBOLS);

EID: 0038736951     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(02)00438-9     Document Type: Conference Paper

References (17)

1. P.-O. Anderson, Superimposed codes for the Euclidean channel, Ph.D. Thesis no. 342, Linköping University, Linköping, Sweden, 1994.
2. P.G. Boyvalenkov, D.P. Danev, and S.P. Bumova Upper bounds on the minimum distance of spherical codes IEEE Trans. Inform. Theory 42 5 1996 1576 1581
3. J.H. Conway, R.H. Hardin, and N.J.A. Sloane Packing lines, planes, etc., packings in grassmannian spaces Experimental Math. 5 1996 139 159
4. J.H. Conway, N.J.A. Sloane, Sphere Packings, Lattices and Groups, 3rd Edition, Springer, New York, 1999 (with additional contributions by E. Bannai, R.E. Borcherds, J. Leech, S.P. Norton, A.M. Odlyzko, R.A. Parker, L. Queen, B.B. Venkov).
5. D. Danev, Superimposed codes in R n obtained from spherical codes, in: Proceedings of the International Workshop on Coding and Cryptography, Paris, France, January 2001, pp. 157-166.
6. S.M. Dodunekov, T. Ericson, and V.A. Zinovév A concatenation method for constructing spherical codes in n-dimensional Euclidean space Problemy Peredachi Informatsii 27 4 1991 34 38
7. T. Ericson, L. Györfi, Superimposed codes in R n, Internal Report LiTH-ISY-I-0818, Department of Electrical Engineering, Linköping University, Linköping, Sweden, October 1986.
8. T. Ericson, and L. Györfi Superimposed codes in R n IEEE Trans. Inform. Theory 34 4 1998 877 880
9. T. Ericson, and V.I. Levenshtein Superimposed codes in the hamming space IEEE Trans. Inform. Theory 40 6 1994 1882 1893
10. T. Ericson, and V. Zinoviev On spherical codes generating the kissing number in dimensions 8 and 24 Discrete Math. 106/107 1992 199 207 (a collection of contributions in honour of Jack van Lint)
11. T. Ericson, and V. Zinoviev Spherical codes generated by binary partitions of symmetric pointsets IEEE Trans. Inform. Theory 41 1 1995 107 129
12. T. Ericson, V. Zinoviev, Codes on Euclidean Spheres, Vol. 63, North-Holland Mathematical Library, Amsterdam, 2001.
13. Z. Füredi, and M. Ruszinkó An improved upper bound of the rate of Euclidean superimposed codes IEEE Trans. Inform. Theory 45 2 1999 799 802
14. V.I. Levenshtein, Packing of polynomial metric spaces, in: Proceedings of the Third International Workshop on Information Theory, Sochi, 1987, pp. 271-274.
15. V.I. Levenshtein Designs as maximum codes in polynomial metric spaces Acta Appl. Math. 25 1992 1 83
16. N.J.A. Sloane, How to pack lines, planes, 3-spaces, etc. [webpage], http://www.research.att.com/~njas/grass/.
17. J.H. van Lint, and J.J. Seidel Equilateral point sets in elliptic geometry Proc. Kon. Nederl. Akad. Wet. A 69 1966 335 348