{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,10]],"date-time":"2023-01-10T12:07:46Z","timestamp":1673352466340},"reference-count":17,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2003,5,1]],"date-time":"2003-05-01T00:00:00Z","timestamp":1051747200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":3730,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2003,5]]},"DOI":"10.1016\/s0166-218x(02)00438-9","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T23:10:20Z","timestamp":1052781020000},"page":"85-101","source":"Crossref","is-referenced-by-count":2,"title":["Some constructions of superimposed codes in Euclidean spaces"],"prefix":"10.1016","volume":"128","author":[{"given":"Danyo","family":"Danev","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(02)00438-9_BIB1","unstructured":"P.-O. Anderson, Superimposed codes for the Euclidean channel, Ph.D. Thesis no. 342, Link\u00f6ping University, Link\u00f6ping, Sweden, 1994."},{"issue":"5","key":"10.1016\/S0166-218X(02)00438-9_BIB2","doi-asserted-by":"crossref","first-page":"1576","DOI":"10.1109\/18.532903","article-title":"Upper bounds on the minimum distance of spherical codes","volume":"42","author":"Boyvalenkov","year":"1996","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/S0166-218X(02)00438-9_BIB3","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1080\/10586458.1996.10504585","article-title":"Packing lines, planes, etc., packings in grassmannian spaces","volume":"5","author":"Conway","year":"1996","journal-title":"Experimental Math."},{"key":"10.1016\/S0166-218X(02)00438-9_BIB4","unstructured":"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)."},{"key":"10.1016\/S0166-218X(02)00438-9_BIB5","doi-asserted-by":"crossref","unstructured":"D. Danev, Superimposed codes in Rn obtained from spherical codes, in: Proceedings of the International Workshop on Coding and Cryptography, Paris, France, January 2001, pp. 157\u2013166.","DOI":"10.1016\/S1571-0653(04)00160-X"},{"issue":"4","key":"10.1016\/S0166-218X(02)00438-9_BIB6","first-page":"34","article-title":"A concatenation method for constructing spherical codes in n-dimensional Euclidean space","volume":"27","author":"Dodunekov","year":"1991","journal-title":"Problemy Peredachi Informatsii"},{"key":"10.1016\/S0166-218X(02)00438-9_BIB7","unstructured":"T. Ericson, L. Gy\u00f6rfi, Superimposed codes in Rn, Internal Report LiTH-ISY-I-0818, Department of Electrical Engineering, Link\u00f6ping University, Link\u00f6ping, Sweden, October 1986."},{"issue":"4","key":"10.1016\/S0166-218X(02)00438-9_BIB8","doi-asserted-by":"crossref","first-page":"877","DOI":"10.1109\/18.9789","article-title":"Superimposed codes in Rn","volume":"34","author":"Ericson","year":"1998","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"6","key":"10.1016\/S0166-218X(02)00438-9_BIB9","doi-asserted-by":"crossref","first-page":"1882","DOI":"10.1109\/18.340463","article-title":"Superimposed codes in the hamming space","volume":"40","author":"Ericson","year":"1994","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/S0166-218X(02)00438-9_BIB10","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0012-365X(92)90547-S","article-title":"On spherical codes generating the kissing number in dimensions 8 and 24","volume":"106\/107","author":"Ericson","year":"1992","journal-title":"Discrete Math."},{"issue":"1","key":"10.1016\/S0166-218X(02)00438-9_BIB11","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1109\/18.370114","article-title":"Spherical codes generated by binary partitions of symmetric pointsets","volume":"41","author":"Ericson","year":"1995","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/S0166-218X(02)00438-9_BIB12","unstructured":"T. Ericson, V. Zinoviev, Codes on Euclidean Spheres, Vol. 63, North-Holland Mathematical Library, Amsterdam, 2001."},{"issue":"2","key":"10.1016\/S0166-218X(02)00438-9_BIB13","doi-asserted-by":"crossref","first-page":"799","DOI":"10.1109\/18.749032","article-title":"An improved upper bound of the rate of Euclidean superimposed codes","volume":"45","author":"F\u00fcredi","year":"1999","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/S0166-218X(02)00438-9_BIB14","unstructured":"V.I. Levenshtein, Packing of polynomial metric spaces, in: Proceedings of the Third International Workshop on Information Theory, Sochi, 1987, pp. 271\u2013274."},{"key":"10.1016\/S0166-218X(02)00438-9_BIB15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF00053379","article-title":"Designs as maximum codes in polynomial metric spaces","volume":"25","author":"Levenshtein","year":"1992","journal-title":"Acta Appl. Math."},{"key":"10.1016\/S0166-218X(02)00438-9_BIB16","unstructured":"N.J.A. Sloane, How to pack lines, planes, 3-spaces, etc. [webpage], http:\/\/www.research.att.com\/~njas\/grass\/."},{"key":"10.1016\/S0166-218X(02)00438-9_BIB17","first-page":"335","article-title":"Equilateral point sets in elliptic geometry","volume":"69","author":"van Lint","year":"1966","journal-title":"Proc. Kon. Nederl. Akad. Wet. A"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X02004389?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X02004389?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,17]],"date-time":"2020-03-17T16:56:58Z","timestamp":1584464218000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X02004389"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,5]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,5]]}},"alternative-id":["S0166218X02004389"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(02)00438-9","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2003,5]]}}}