{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T00:56:13Z","timestamp":1775091373090,"version":"3.50.1"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2013,12,11]],"date-time":"2013-12-11T00:00:00Z","timestamp":1386720000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Cryptogr. Commun."],"published-print":{"date-parts":[[2014,3]]},"DOI":"10.1007\/s12095-013-0095-9","type":"journal-article","created":{"date-parts":[[2013,12,10]],"date-time":"2013-12-10T06:51:23Z","timestamp":1386658283000},"page":"3-25","source":"Crossref","is-referenced-by-count":8,"title":["A complementary construction using mutually unbiased bases"],"prefix":"10.1007","volume":"6","author":[{"given":"Gaofei","family":"Wu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthew Geoffrey","family":"Parker","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,12,11]]},"reference":[{"issue":"3","key":"95_CR1","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1016\/0012-365X(80)90159-4","volume":"29","author":"JP Barthelemy","year":"1980","unstructured":"Barthelemy, J.P: An asymptotic equivalent for the number of total preorders on a finite set. Discret. Math. 29(3), 311\u2013313 (1980)","journal-title":"Discret. Math."},{"key":"95_CR2","doi-asserted-by":"crossref","unstructured":"Bian, X., Yu, N.Y: Partial fourier codebooks associated with multiplied golay complementary sequences for compressed sensing. Sequences and Their Applications - SETA 2012 Lecture Notes in Computer Science, vol. 7280, pp. 257\u2013268, 2012","DOI":"10.1007\/978-3-642-30615-0_24"},{"key":"95_CR3","unstructured":"Bj\u00f8rstad, T.E., Parker, M.G.: Equivalence between certain complementary pairs of types I and III. In: Preneel, B., Dodunekov, S., Rijmen, V., Nikova, S. (eds.) Enhancing Cryptographic Primitives with Techniques from Error Correcting Codes. Invited talk at NATO Science for Peace and Security Series - D: Information and Communication Security, vol. 23. http:\/\/www.ii.uib.no\/matthew\/CompEquivCorrected. pdf (2009)"},{"key":"95_CR4","doi-asserted-by":"crossref","first-page":"881","DOI":"10.1049\/el:19900576","volume":"26","author":"SZ Budi\u030csin","year":"1990","unstructured":"Budi\u030csin, S.Z.: New complementary pairs of sequences. Electron. Lett. 26, 881\u2013883 (1990)","journal-title":"Electron. Lett."},{"key":"95_CR5","doi-asserted-by":"crossref","unstructured":"Budi\u030csin, S.Z., Spasojevi\u0107, P.: Filter bank representation of complementary sequence pairs. In: 15th Annual Allerton Conference. Allerton House, UIUC, Illinois (2012)","DOI":"10.1109\/Allerton.2012.6483289"},{"key":"95_CR6","doi-asserted-by":"crossref","unstructured":"Budi\u030csin, S.Z., Spasojevi\u0107, P.: Paraunitary generation\/correlation of QAM complementary sequence pairs. Crypt. Commun. 5(3) (2013)","DOI":"10.1007\/s12095-013-0087-9"},{"key":"95_CR7","unstructured":"Cloitre, B.: The On-Line Encyclopedia of Integer Sequences, A050351 (A094416), asymptotic formula, http:\/\/oeis.org\/ (2013)"},{"issue":"11","key":"95_CR8","doi-asserted-by":"crossref","first-page":"2397","DOI":"10.1109\/18.796380","volume":"45","author":"JA Davis","year":"1999","unstructured":"Davis, J.A., Jedwab, J.: Peak-to-mean power control for OFDM, Golay complementary sequences, and Reed-Muller codes. IEEE Trans. Inform. Theory 45(11), 2397\u20132417 (1999)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"95_CR9","doi-asserted-by":"crossref","first-page":"535","DOI":"10.1142\/S0219749910006502","volume":"8","author":"T Durt","year":"2010","unstructured":"Durt, T., Englert, B.-G., Bengtsson, I., Zyczkowski, K.: On mutually unbiased bases. Int. J. Quantum Inf. 8, 535\u2013640 (2010). arXiv: 1004.3348 [quant-ph]","journal-title":"Int. J. Quantum Inf."},{"key":"95_CR10","doi-asserted-by":"crossref","first-page":"753","DOI":"10.1016\/j.jcta.2007.10.001","volume":"115","author":"F Fiedler","year":"2008","unstructured":"Fiedler, F., Jedwab, J., Parker, M.G.: A multi-dimensional approach to the construction and enumeration of Golay complementary sequences. J. Comb. Theory (Series A) 115, 753\u2013776 (2008)","journal-title":"J. Comb. Theory (Series A)"},{"issue":"7","key":"95_CR11","doi-asserted-by":"crossref","first-page":"3113","DOI":"10.1109\/TIT.2008.924667","volume":"54","author":"F Fiedler","year":"2008","unstructured":"Fiedler, F., Jedwab, J., Parker, M.G.: A framework for the construction of Golay sequences. IEEE Trans. Inform. Theory 54(7), 3113\u20133129 (2008)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"2","key":"95_CR12","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1109\/TIT.1961.1057620","volume":"IT-7","author":"MJE Golay","year":"1961","unstructured":"Golay, M.J.E.: Complementary series. IEEE Trans. Inf. Theory IT-7(2), 82\u201387 (1961)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"95_CR13","unstructured":"Hein, M., Dur, W., Eisert, J., Raussendorf, R., Van den Nest, M., Briegel, H.-J.: Entanglement in graph states and its applications. In: Zoller, P., Casati, G., Shepelyansky, D., Benenti, G. (eds.) International School of Physics Enrico Fermi (Varenna, Italy), Quantum Computers, Algorithms and Chaos, vol. 162. arXiv: 0602096 [quant-ph] (2006)"},{"issue":"12","key":"95_CR14","doi-asserted-by":"crossref","first-page":"3241","DOI":"10.1088\/0305-4470\/14\/12\/019","volume":"14","author":"ID Ivanovi\u0107","year":"1981","unstructured":"Ivanovi\u0107, I.D.: Geometrical description of quantal state determination. J. Phys. A 14(12), 3241\u20133245 (1981)","journal-title":"J. Phys. A"},{"key":"95_CR15","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1007\/s10623-007-9088-z","volume":"44","author":"J Jedwab","year":"2007","unstructured":"Jedwab, J., Parker, M.G.: Golay complementary array pairs. Des. Codes Crypt. 44, 209\u2013216 (2007)","journal-title":"Des. Codes Crypt."},{"key":"95_CR16","doi-asserted-by":"crossref","unstructured":"Kschischang, F.R., Frey, B.J., Loeliger, H.-A.: Factor graphs and the sum-product algorithm. IEEE Trans. Inform. Theory 47(2) (2001)","DOI":"10.1109\/18.910572"},{"key":"95_CR17","doi-asserted-by":"crossref","unstructured":"Matsufuji, S., Shigemitsu, R., Tanada, Y., Kuroyanagi, N.: Construction of complementary arrays. In: Proceedings of Sympotic\u201904, pp. 78\u201381 (2004)","DOI":"10.1109\/TIC.2004.1409503"},{"key":"95_CR18","unstructured":"The On-Line Encyclopedia of Integer Sequences. http:\/\/oeis.org\/ (2013)"},{"key":"95_CR19","unstructured":"Parker, M.G., Tellambura, C.: Golay-Davis-Jedwab complementary sequences and rudin-shapiro constructions. In:International Symposium in Information Theory, p. 302. Sorrento (2000)"},{"key":"95_CR20","unstructured":"Parker, M.G., Tellambura, C.: A construction for binary sequence sets with low peak-to-average power ratio. Reports in Informatics. Report No 242, ISSN 0333\u20133590. University of Bergen. http:\/\/www.ii.uib.no\/matthew\/ConstructReport.pdf (2003)"},{"key":"95_CR21","doi-asserted-by":"crossref","unstructured":"Parker, M.G., Riera, C.: Generalised complementary arrays. Lecture Notes in Computer Science, LNCS, vol. 7089. Springer (2011)","DOI":"10.1007\/978-3-642-25516-8_4"},{"key":"95_CR22","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1109\/18.817512","volume":"46","author":"KG Paterson","year":"2000","unstructured":"Paterson, K.G.: Generalized Reed-Muller codes and power control in OFDM modulation. IEEE Trans. Inform. Theory 46, 104\u2013120 (2000)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"95_CR23","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1007\/s10623-008-9167-9","volume":"48","author":"C Riera","year":"2008","unstructured":"Riera, C., Jacob, S., Parker, M.G.: From Graph states to two-graph states. Des. Codes Crypt 48, 2 (2008). arXiv: 0801.4754 [quant-ph]","journal-title":"Des. Codes Crypt"},{"issue":"3","key":"95_CR24","doi-asserted-by":"crossref","first-page":"709","DOI":"10.1007\/s10440-009-9508-3","volume":"108","author":"MB Ruskai","year":"2009","unstructured":"Ruskai, M.B.: Some connections between frames, mutually unbiased bases, and POVM\u2019s in quantum information theory. Acta Appl. Math. 108(3), 709\u2013719 (2009)","journal-title":"Acta Appl. Math."},{"key":"95_CR25","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/978-1-4471-0551-0_6","volume-title":"Proceedings of SETA\u201998 Sequences Their Application","author":"D Sarwate","year":"1999","unstructured":"Sarwate, D.: Meeting the Welch bound with equality. In: Proceedings of SETA\u201998 Sequences Their Application, pp. 79\u2013102. Springer, London (1999)"},{"issue":"7","key":"95_CR26","doi-asserted-by":"crossref","first-page":"3220","DOI":"10.1109\/TIT.2006.876252","volume":"52","author":"K-U Schmidt","year":"2006","unstructured":"Schmidt, K.-U.: On cosets of the generalized first-order Reed-Muller code with low PMEPR. IEEE Trans. Inf. Theory 52(7), 3220\u20133232 (2006)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"95_CR27","doi-asserted-by":"crossref","first-page":"808","DOI":"10.1109\/TIT.2006.889723","volume":"53","author":"K-U Schmidt","year":"2007","unstructured":"Schmidt, K.-U.: Complementary sets, generalized Reed-Muller codes, and power control for OFDM. IEEE Trans. Inf. Theory 53(2), 808\u2013814 (2007)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"95_CR28","doi-asserted-by":"crossref","unstructured":"Schwinger, J.: Unitary Operator Bases. Harvard University (1960)","DOI":"10.1073\/pnas.46.4.570"},{"key":"95_CR29","unstructured":"Shapiro, H.S.: Extremal Problems for Polynomials and Power Series. Master\u2019s thesis, Mass. Inst. of Technology (1951)"},{"issue":"1","key":"95_CR30","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1109\/18.2615","volume":"IT-34","author":"N Suehiro","year":"1988","unstructured":"Suehiro, N., Hatori, M.: N-shift cross-orthogonal sequences. IEEE Trans. Inform. Theory IT-34(1), 143\u2013146 (1988)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"95_CR31","doi-asserted-by":"crossref","unstructured":"Wang, Z., Parker, M.G., Gong, G., Wu, G.: On the PMEPR of binary Golay sequences of length 2 n . submitted (June 2013)","DOI":"10.1109\/TIT.2014.2300867"},{"issue":"3","key":"95_CR32","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1109\/TIT.1974.1055219","volume":"20","author":"L Welch","year":"1974","unstructured":"Welch, L.: Lower bounds on the maximum cross correlation of signals. IEEE Trans. Inform. Theory 20(3), 397\u2013399 (1974)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"95_CR33","volume-title":"Generating Functionology","author":"HS Wilf","year":"1994","unstructured":"Wilf, H.S.: Generating Functionology, 2nd edn. Academic, NY (1994)","edition":"2"}],"container-title":["Cryptography and Communications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-013-0095-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12095-013-0095-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-013-0095-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T03:53:18Z","timestamp":1746071598000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12095-013-0095-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,12,11]]},"references-count":33,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,3]]}},"alternative-id":["95"],"URL":"https:\/\/doi.org\/10.1007\/s12095-013-0095-9","relation":{},"ISSN":["1936-2447","1936-2455"],"issn-type":[{"value":"1936-2447","type":"print"},{"value":"1936-2455","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,12,11]]}}}