{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T15:56:39Z","timestamp":1775145399294,"version":"3.50.1"},"reference-count":31,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,7]]},"DOI":"10.1109\/isit.2019.8849641","type":"proceedings-article","created":{"date-parts":[[2019,9,26]],"date-time":"2019-09-26T21:46:12Z","timestamp":1569534372000},"page":"2284-2288","source":"Crossref","is-referenced-by-count":6,"title":["Near-Optimal Zero Correlation Zone Sequence Sets from Paraunitary Matrices"],"prefix":"10.1109","author":[{"given":"Shibsankar","family":"Das","sequence":"first","affiliation":[{"name":"Department of Mathematics, Indian Institute of Technology Patna, Bihar, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Udaya","family":"Parampalli","sequence":"additional","affiliation":[{"name":"School of Computing and Information Systems, University of Melbourne, Victoria, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sudhan","family":"Majhi","sequence":"additional","affiliation":[{"name":"Department of Electrical Engineering, Indian Institute of Technology Patna, Bihar, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zilong","family":"Liu","sequence":"additional","affiliation":[{"name":"Institute for Communication Systems, 5G Innovation Centre, University of Surrey, U.K."}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1090\/S0894-0347-99-00298-2"},{"key":"ref30","first-page":"459","article-title":"A unified construction of perfect polyphase sequences","author":"mow","year":"1995","journal-title":"Proc IEEE ISIT"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.825399"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.928256"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2009.2020888"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1093\/ietfec\/e91-a.12.3698"},{"key":"ref14","doi-asserted-by":"crossref","first-page":"3817","DOI":"10.1109\/TIT.2006.878171","article-title":"A new framework for constructing mutually orthogonal complementary sets and ZCZ sequences","volume":"52","author":"rathinakumar","year":"2006","journal-title":"IEEE Trans Inf Theory"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1972.1054860"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1049\/el:19900576"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/18.796380"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/18.2615"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/s12095-013-0087-9"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9939-1962-0142557-0"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TMTT.2016.2613530"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2019.2908137"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2017.2688399"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1049\/el:20000462"},{"key":"ref29","first-page":"1","article-title":"An improved multiplier-free generator for polyphase complete complementary codes","author":"das","year":"2018","journal-title":"Proc 10th International Conference on Sequences and Their Applications (SETA-2018)"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2012.6503922"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2014.6970900"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1587\/transfun.E94.A.1159"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2007.914055"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ISSSTA.2010.5654347"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/49.126984"},{"key":"ref20","author":"vaidyanathan","year":"1993","journal-title":"Multi-rate Systems and Filter Banks"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2839676"},{"key":"ref21","first-page":"1","article-title":"A new method to construct Golay complementary set by paraunitary matrices and Hadamard matrices","author":"wang","year":"2016","journal-title":"Proc 9th International Conference on Sequences and Their Applications (SETA-2016)"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2018.2849656"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2017.2780050"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2018.2876613"},{"key":"ref25","first-page":"1","article-title":"A novel? multiplier-free generator for complete complementary codes","author":"das","year":"2017","journal-title":"Proc Asia-Pacific Conference on Communications (APCC"}],"event":{"name":"2019 IEEE International Symposium on Information Theory (ISIT)","location":"Paris, France","start":{"date-parts":[[2019,7,7]]},"end":{"date-parts":[[2019,7,12]]}},"container-title":["2019 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8827389\/8849208\/08849641.pdf?arnumber=8849641","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:34:15Z","timestamp":1773347655000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8849641\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7]]},"references-count":31,"URL":"https:\/\/doi.org\/10.1109\/isit.2019.8849641","relation":{},"subject":[],"published":{"date-parts":[[2019,7]]}}}