{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T16:09:07Z","timestamp":1775146147412,"version":"3.50.1"},"reference-count":34,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2021,6,1]],"date-time":"2021-06-01T00:00:00Z","timestamp":1622505600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,6,1]],"date-time":"2021-06-01T00:00:00Z","timestamp":1622505600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,6,1]],"date-time":"2021-06-01T00:00:00Z","timestamp":1622505600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100004663","name":"Ministry of Science and Technology, Taiwan, China","doi-asserted-by":"publisher","award":["MOST 107-2221-E-006-065-MY2"],"award-info":[{"award-number":["MOST 107-2221-E-006-065-MY2"]}],"id":[{"id":"10.13039\/501100004663","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2021,6]]},"DOI":"10.1109\/tit.2020.2980818","type":"journal-article","created":{"date-parts":[[2020,3,17]],"date-time":"2020-03-17T02:48:30Z","timestamp":1584413310000},"page":"3464-3472","source":"Crossref","is-referenced-by-count":24,"title":["How to Construct Mutually Orthogonal Complementary Sets With Non-Power-of-Two Lengths?"],"prefix":"10.1109","volume":"67","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8668-4199","authenticated-orcid":false,"given":"Shing-Wei","family":"Wu","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3717-5600","authenticated-orcid":false,"given":"Chao-Yu","family":"Chen","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5851-4261","authenticated-orcid":false,"given":"Zilongs","family":"Liu","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref33","author":"macwilliams","year":"1977","journal-title":"The Theory of Error Correcting Codes"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2162182"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2015.2511092"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2019.2908137"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2018.2864705"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1049\/el.2010.1394"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2014.2337272"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2008.907"},{"key":"ref13","first-page":"45","article-title":"A disaster prevention broadcasting based on data hiding scheme using complete complementary codes","author":"kojima","year":"2014","journal-title":"Proc Int Symp Inf Theory Appl (ISITA)"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/18.796380"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/18.817512"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.842775"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2014.2300163"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2335731"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.889723"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2017.2780050"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/26.818873"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2017.2773093"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/18.2615"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1002\/9780470022962"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2018.2849656"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/35.956124"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2014.2365467"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2013.122013.130148"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1972.1054860"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2007.899947"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1961.1057620"},{"key":"ref20","first-page":"239","article-title":"A construction for binary sequence sets with low peak-to-average power ratio","author":"parker","year":"2003","journal-title":"Proc IEEE Int Symp Inf Theory"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/11617983_31"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2005.1494425"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2008.081189"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.915980"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/WCNC.2017.7925642"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2613994"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/9437276\/09036980.pdf?arnumber=9036980","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T14:54:19Z","timestamp":1652194459000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9036980\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6]]},"references-count":34,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/tit.2020.2980818","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,6]]}}}