{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T16:04:50Z","timestamp":1774022690756,"version":"3.50.1"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2013,10,24]],"date-time":"2013-10-24T00:00:00Z","timestamp":1382572800000},"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":[[2015,4]]},"DOI":"10.1007\/s10623-013-9891-7","type":"journal-article","created":{"date-parts":[[2013,10,23]],"date-time":"2013-10-23T12:11:53Z","timestamp":1382530313000},"page":"43-57","source":"Crossref","is-referenced-by-count":30,"title":["Two families of nearly optimal codebooks"],"prefix":"10.1007","volume":"75","author":[{"given":"Chengju","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qin","family":"Yue","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yiwei","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,10,24]]},"reference":[{"key":"9891_CR1","unstructured":"Arasu K.T., Ding C., Helleseth T., Kumar P.V., Martinsen H.: Almost difference sets and their sequences with optimal autocorrelation. IEEE Trans. Inf. Theory 47(7), 2834\u20132943 (2001)."},{"key":"9891_CR2","unstructured":"Arasu K.T., Jungnickel D., Ma S.L., Pott A.: Strongly regular graphs with $$\\lambda -\\mu =1$$ \u03bb - \u03bc = 1 . J. Comb. Theory Ser. A 67(1), 116\u2013125 (1994)."},{"key":"9891_CR3","doi-asserted-by":"crossref","unstructured":"Conway J.H., Harding R.H., Sloane N.J.A.: Packing lines, planes, etc.: packings in Grassmannian spaces. Exp. Math. 5(2), 139\u2013159 (1996).","DOI":"10.1080\/10586458.1996.10504585"},{"key":"9891_CR4","unstructured":"Ding C.: Complex codebooks from combinatorial designs. IEEE Trans. Inf. Theory 52(9), 4229\u20134235 (2006)."},{"key":"9891_CR5","unstructured":"Ding C., Feng T.: A generic construction of complex codebooks meeting the Welch bound. IEEE Trans. Inf. Theory 53(11), 4245\u20134250 (2007)."},{"key":"9891_CR6","doi-asserted-by":"crossref","unstructured":"Ding C., Feng T.: Codebooks from almost difference sets. Des. Codes Cryptogr. 46, 113\u2013126 (2008).","DOI":"10.1007\/s10623-007-9140-z"},{"key":"9891_CR7","doi-asserted-by":"crossref","unstructured":"Ding C., Pott A., Wang Q.: Constructions of almost difference sets from finite fieds. Des. Codes Cryptogr. (2013). doi: 10.1007\/s10623-012-9789-9 .","DOI":"10.1007\/s10623-012-9789-9"},{"key":"9891_CR8","unstructured":"Feng T., Momihara K., Xiang Q.: Constructions of strongly regular Cayley graphs and skew Hadamard difference sets from cyclotomic classes, arXiv:1201.0701v1."},{"key":"9891_CR9","unstructured":"Feng T., Xiang Q.: Strongly regular graphs from unions of cyclotomic classess. J. Comb. Theory Ser. B 102, 982\u2013995 (2012)."},{"key":"9891_CR10","doi-asserted-by":"crossref","unstructured":"Fickus M., Mixon D.G., Tremain J.C.: Steiner equiangular tight frames. Linear Algebra Appl. 436, 1014\u20131027 (2012).","DOI":"10.1016\/j.laa.2011.06.027"},{"key":"9891_CR11","doi-asserted-by":"crossref","unstructured":"Hu L., Yue Q.: Gauss periods and codebooks from generalized cyclotomic sets of order four. Des. Codes Cryptogr. 69, 233\u2013246 (2013).","DOI":"10.1007\/s10623-012-9648-8"},{"key":"9891_CR12","unstructured":"Lidl R., Niederreiter H.: Finite Fields. Addison-Wesley Publishing Inc., London (1983)."},{"key":"9891_CR13","doi-asserted-by":"crossref","unstructured":"Ma S.L.: Partial difference sets. Discrete Math. 52, 75\u201389 (1984).","DOI":"10.1016\/0012-365X(84)90105-5"},{"key":"9891_CR14","doi-asserted-by":"crossref","unstructured":"Ma S.L.: A survey of partial difference sets. Des. Codes Cryptogr. 4, 221\u2013261 (1994).","DOI":"10.1007\/BF01388454"},{"key":"9891_CR15","doi-asserted-by":"crossref","unstructured":"Paley R.E.A.C.: On orthogonal matrices. J. Math. Phys. 12, 311\u2013320 (1933).","DOI":"10.1002\/sapm1933121311"},{"key":"9891_CR16","unstructured":"Sarwate D.: Meeting the Welch bound with equality. In: Ding C., Helleseth T., Niederreiter H. (eds.) Sequences and Their Applications: Proceedings of SETA\u201998. DMTCS Series, pp. 79\u2013102. Springer-Verlag, New York (1999)."},{"key":"9891_CR17","unstructured":"Strohmer T., Heath R.: Grassmannian frames with applications to coding and communication. Appl. Comput. Harmon. Anal. 14(3), 257\u2013275 (2003)."},{"key":"9891_CR18","unstructured":"Welch L.: Lower bounds on the maximum cross correlation of signals. IEEE Trans. Inf. Theory 20(3), 397\u2013399 (1974)."},{"key":"9891_CR19","unstructured":"Xia P., Zhou S., Giannakis G.B.: Achieving the Welch bound with difference sets. IEEE Trans. Inf. Theory 51(5), 1900\u20131907 (2005)."},{"key":"9891_CR20","doi-asserted-by":"crossref","unstructured":"Yu N.Y.: A construction of codebooks associated with binary sequences. IEEE Trans. Inf. Theory 58(8) (2012).","DOI":"10.1109\/TIT.2012.2196021"},{"key":"9891_CR21","doi-asserted-by":"crossref","unstructured":"Yu N.Y., Feng K., Zhang A.: A new class of near-optimal Fourier codebooks from an almost difference set. Des. Codes Cryptogr. (2012). doi: 10.1007\/s10623-012-9753-8 .","DOI":"10.1007\/s10623-012-9753-8"},{"key":"9891_CR22","doi-asserted-by":"crossref","unstructured":"Zhang A., Feng K.: Construction of cyclotomic codebooks nearly meeting the Welch bound. Des. Codes Cryptogr. 63, 209\u2013224 (2012).","DOI":"10.1007\/s10623-011-9549-2"},{"key":"9891_CR23","unstructured":"Zhang A., Feng K.: Two classes of codebooks nearly meeting the Welch bound. IEEE Trans. Inf. Theory 58(4), 2507\u20132511 (2012)."},{"key":"9891_CR24","unstructured":"Zhou Z., Tang X.: New nearly optimal codebooks from relative difference sets. Adv. Math. Commun. 5(3), 521\u2013527 (2011)."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-013-9891-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-013-9891-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-013-9891-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,31]],"date-time":"2019-07-31T02:24:46Z","timestamp":1564539886000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-013-9891-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,10,24]]},"references-count":24,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,4]]}},"alternative-id":["9891"],"URL":"https:\/\/doi.org\/10.1007\/s10623-013-9891-7","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,10,24]]}}}