{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T16:05:14Z","timestamp":1774022714919,"version":"3.50.1"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2007,10,20]],"date-time":"2007-10-20T00:00:00Z","timestamp":1192838400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2008,1]]},"DOI":"10.1007\/s10623-007-9140-z","type":"journal-article","created":{"date-parts":[[2007,10,19]],"date-time":"2007-10-19T13:34:46Z","timestamp":1192800886000},"page":"113-126","source":"Crossref","is-referenced-by-count":39,"title":["Codebooks from almost difference sets"],"prefix":"10.1007","volume":"46","author":[{"given":"Cunsheng","family":"Ding","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tao","family":"Feng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,10,20]]},"reference":[{"issue":"7","key":"9140_CR1","doi-asserted-by":"crossref","first-page":"2834","DOI":"10.1109\/18.959271","volume":"47","author":"K.T. Arasu","year":"2001","unstructured":"Arasu K.T., Ding C., Helleseth T., Kumar P.V., Martinsen H. (2001). Almost difference sets and their sequences with optimal autocorrelation. IEEE Trans. Inform. Theory 47(7): 2834\u20132843","journal-title":"IEEE Trans. Inform. Theory"},{"key":"9140_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0061260","volume-title":"Cyclic Difference Sets, Lecture Notes in Mathematics, vol 182","author":"L.D. Baumert","year":"1971","unstructured":"Baumert L.D. (1971). Cyclic Difference Sets, Lecture Notes in Mathematics, vol 182. Springer, Berlin"},{"key":"9140_CR3","volume-title":"Design Theory","author":"T. Beth","year":"1999","unstructured":"Beth T., Jungnickel D., Lenz H. (1999). Design Theory. Cambridge University Press, Cambridge"},{"issue":"3","key":"9140_CR4","doi-asserted-by":"crossref","first-page":"436","DOI":"10.1112\/S0024611597000403","volume":"75","author":"A.R. Calderbank","year":"1997","unstructured":"Calderbank A.R., Cameron P.J., Kantor W.M., Seidel J.J. (1997). Z 4-Kerdock codes, orthogonal spreads, and extremal Euclidean line-sets. Proc. London Math. Soc. 75(3): 436\u2013480","journal-title":"Proc. London Math. Soc."},{"issue":"2","key":"9140_CR5","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1080\/10586458.1996.10504585","volume":"5","author":"J.H. Conway","year":"1996","unstructured":"Conway J.H., Harding R.H., Sloane N.J.A. (1996). Packing lines, planes, etc.: packings in Grassmannian spaces. Exp. Math. 5(2): 139\u2013159","journal-title":"Exp. Math."},{"issue":"3","key":"9140_CR6","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1007\/BF03187604","volume":"67","author":"P. Delsarte","year":"1977","unstructured":"Delsarte P., Goethals J.M., Seidel J.J. (1977). Spherical codes and designs. Geom. Dedicate 67(3): 363\u2013388","journal-title":"Geom. Dedicate"},{"key":"9140_CR7","first-page":"1698","volume":"44","author":"C. Ding","year":"1998","unstructured":"Ding C. (1998). Autocorrelation values of the generalized cyclotomic sequences of order 2. IEEE Trans. Inform. Theory 44: 1698\u20131702","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"9","key":"9140_CR8","doi-asserted-by":"crossref","first-page":"4229","DOI":"10.1109\/TIT.2006.880058","volume":"52","author":"C. Ding","year":"2006","unstructured":"Ding C. (2006). Complex codebooks from combinatorial designs. IEEE Trans. Inform. Theory 52(9): 4229\u20134235","journal-title":"IEEE Trans. Inform. Theory"},{"key":"9140_CR9","doi-asserted-by":"crossref","unstructured":"Ding C., Feng T.: A generic construction of complex codebooks meeting the Welch bound. IEEE Trans. Inform. Theory 11 (2007), to appear.","DOI":"10.1109\/TIT.2007.907343"},{"key":"9140_CR10","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1023\/A:1024759310058","volume":"30","author":"C. Ding","year":"2003","unstructured":"Ding C., Golin M., Kl\u00f8ve T. (2003). Meeting the Welch and Karystinos-Pados bounds on DS-CDMA binary signature sets. Des. Codes Cryptogr. 30: 73\u201384","journal-title":"Des. Codes Cryptogr."},{"key":"9140_CR11","doi-asserted-by":"crossref","first-page":"428","DOI":"10.1109\/18.904555","volume":"47","author":"C. Ding","year":"2001","unstructured":"Ding C., Helleseth T., Martinsen H.M. (2001). New families of binary sequences with optimal three-level autocorrelation. IEEE Trans. Inform. Theory 47: 428\u2013433","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"7","key":"9140_CR12","doi-asserted-by":"crossref","first-page":"1526","DOI":"10.1016\/j.jcta.2005.10.006","volume":"113","author":"C. Ding","year":"2006","unstructured":"Ding C., Yuan J. (2006). A family of skew Paley-Hadamard difference sets. J. Comb. Theory A 113(7): 1526\u20131535","journal-title":"J. Comb. Theory A"},{"key":"9140_CR13","first-page":"260","volume":"3","author":"G.N. Karystinos","year":"2003","unstructured":"Karystinos G.N., Pados D.A. (2003). New bounds on the total-squared-correlation and perfect design of DS-CDMA binary signature sets. IEEE Trans. Commun. 3: 260\u2013265","journal-title":"IEEE Trans. Commun."},{"key":"9140_CR14","unstructured":"K\u00f6nig H.: Cubature formulas on spheres. In: Advances in Multivarate Approximation, pp. 201\u2013211. Wiley, New York (1979)."},{"issue":"2","key":"9140_CR15","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1109\/LCOMM.2004.823428","volume":"8","author":"V.P. Ipatov","year":"2004","unstructured":"Ipatov V.P. (2004). On the Karystinos\u2013Pados bounds and optimal binary DS-CDMA signature ensambles. IEEE Comm. Lett. 8(2): 81\u201383","journal-title":"IEEE Comm. Lett."},{"key":"9140_CR16","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1109\/TIT.1977.1055672","volume":"23","author":"A. Lempel","year":"1997","unstructured":"Lempel A., Cohn M., Eastman W.L. (1997). A class of binary sequences with optimal autocorrelation properties. IEEE Trans. Inform. Theory 23: 38\u201342","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"10","key":"9140_CR17","doi-asserted-by":"crossref","first-page":"2735","DOI":"10.1109\/TIT.2003.817466","volume":"49","author":"D.J. Love","year":"2003","unstructured":"Love D.J., Heath R.W., Strohmer T. (2003). Grassmannian beamingforming for multiple-input multiple-output wireless systems. IEEE Trans. Inform. Theory 49(10): 2735\u20132747","journal-title":"IEEE Trans. Inform. Theory"},{"key":"9140_CR18","doi-asserted-by":"crossref","unstructured":"Massey J.L., Mittelholzer T.: Welch\u2019s bound and sequence sets for code-division multiple-access systems. In: Sequences II: Methods in Communication, Security and Computer Science, pp. 63\u201378. Springer, Heidelberg and New York (1993).","DOI":"10.1007\/978-1-4613-9323-8_7"},{"key":"9140_CR19","volume-title":"Finite Geometry and Character Theory. Lecture Notes in Mathematics, vol 1601","author":"A. Pott","year":"1995","unstructured":"Pott A. (1995). Finite Geometry and Character Theory. Lecture Notes in Mathematics, vol 1601. Springer, Berlin"},{"key":"9140_CR20","doi-asserted-by":"crossref","unstructured":"Sarwate D.: Meeting the Welch bound with equality. In: Sequences and their Applications, Proc. of SETA\u2019 98, pp. 79\u2013102. Springer, London (1999).","DOI":"10.1007\/978-1-4471-0551-0_6"},{"key":"9140_CR21","unstructured":"Sidelnikov V.M.: Some k-valued pseudo-random sequences and nearly equidistant codes. Probl. Inform. Trans. 5(1), 12\u201316."},{"key":"9140_CR22","unstructured":"Golomb S.W.: Cyclic Hadamard difference sets\u2014constructions and applications, in: Sequences and their Applications. Proc. of SETA\u2019 98, pp. 39\u201348. Springer, London (1999)."},{"issue":"3","key":"9140_CR23","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/S1063-5203(03)00023-X","volume":"14","author":"T. Strohmer","year":"2003","unstructured":"Strohmer T., Heath Jr. R.W. (2003). Grassmannian frames with applications to coding and communication. Appl. Comput. Harmonic Anal. 14(3): 257\u2013275","journal-title":"Appl. Comput. Harmonic Anal."},{"issue":"3","key":"9140_CR24","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1109\/TIT.1974.1055219","volume":"20","author":"L. Welch","year":"1974","unstructured":"Welch L. (1974). Lower bounds on the maximum cross correlation of signals. IEEE Trans. Inform. Theory 20(3): 397\u2013399","journal-title":"IEEE Trans. Inform. Theory"},{"key":"9140_CR25","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1215\/ijm\/1255631810","volume":"6","author":"A.L. Whiteman","year":"1962","unstructured":"Whiteman A.L. (1962). A family of difference sets. Illinois J. Math. 6: 107\u2013121","journal-title":"Illinois J. Math."},{"issue":"2","key":"9140_CR26","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1016\/0003-4916(89)90322-9","volume":"191","author":"W. Wootters","year":"2005","unstructured":"Wootters W., Fields B. (2005). optimal state-determination by mutually unbiased measurements. Ann. Phys. 191(2): 363\u2013381","journal-title":"Ann. Phys."},{"issue":"5","key":"9140_CR27","doi-asserted-by":"crossref","first-page":"1900","DOI":"10.1109\/TIT.2005.846411","volume":"51","author":"P. Xia","year":"2005","unstructured":"Xia P., Zhou S., Giannakis G.B. (2005). Achieving the Welch bound with difference sets. IEEE Trans. Inform. Theory 51(5): 1900\u20131907","journal-title":"IEEE Trans. Inform. Theory"},{"key":"9140_CR28","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1007\/978-94-011-4459-9_17","volume-title":"Difference Sets, Sequences and their Correlation Properties","author":"Q. Xiang","year":"1999","unstructured":"Xiang Q. (1999). Recent results on difference sets with classical parameters. In: Pott A., Kumar P.V., Helleseth T., Jungnickel D. (eds) Difference Sets, Sequences and their Correlation Properties. Kluwer, Amsterdam, pp. 419\u2013434"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-007-9140-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-007-9140-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-007-9140-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T19:50:09Z","timestamp":1559245809000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-007-9140-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,10,20]]},"references-count":28,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2008,1]]}},"alternative-id":["9140"],"URL":"https:\/\/doi.org\/10.1007\/s10623-007-9140-z","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,10,20]]}}}