{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T09:36:51Z","timestamp":1729676211729,"version":"3.28.0"},"reference-count":17,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014,6]]},"DOI":"10.1109\/isit.2014.6875116","type":"proceedings-article","created":{"date-parts":[[2014,8,19]],"date-time":"2014-08-19T21:50:30Z","timestamp":1408485030000},"page":"1663-1666","source":"Crossref","is-referenced-by-count":0,"title":["New binary sequences with good correlation based on high-order difference and interleaving techniques"],"prefix":"10.1109","author":[{"given":"Min","family":"Zeng","sequence":"first","affiliation":[]},{"given":"Yuan","family":"Luo","sequence":"additional","affiliation":[]},{"given":"Guang","family":"Gong","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"17","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6283051"},{"key":"15","doi-asserted-by":"crossref","first-page":"1596","DOI":"10.1109\/18.623156","article-title":"New construction for families of binary sequences with optimal correlation properties","volume":"43","author":"no","year":"1997","journal-title":"IEEE Trans Inform Theory"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(93)90196-Z"},{"key":"13","doi-asserted-by":"crossref","first-page":"2197","DOI":"10.1109\/18.868491","article-title":"On the depth distribution of linear codes","volume":"46","author":"luo","year":"2000","journal-title":"IEEE Trans Inform Theory"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/18.737545"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.831837"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/18.485726"},{"key":"3","first-page":"39","author":"ding","year":"1994","journal-title":"Stream Cryptography and Its Applications"},{"key":"2","first-page":"276","author":"brualdi","year":"2006","journal-title":"Introductory Combinatorics"},{"key":"1","first-page":"119","volume":"50","author":"abello","year":"1999","journal-title":"On Maximum Clique Problems in Very Large Graphs in Abello J and Vitter J External Memory Algorithms"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1023\/A:1011208514883"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/18.370141"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546907"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(85)90067-8"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/18.605610"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2169297"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.804044"}],"event":{"name":"2014 IEEE International Symposium on Information Theory (ISIT)","start":{"date-parts":[[2014,6,29]]},"location":"Honolulu, HI, USA","end":{"date-parts":[[2014,7,4]]}},"container-title":["2014 IEEE International Symposium on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6867217\/6874773\/06875116.pdf?arnumber=6875116","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,14]],"date-time":"2020-10-14T14:40:05Z","timestamp":1602686405000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/6875116"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,6]]},"references-count":17,"URL":"https:\/\/doi.org\/10.1109\/isit.2014.6875116","relation":{},"subject":[],"published":{"date-parts":[[2014,6]]}}}