{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:56:02Z","timestamp":1773377762169,"version":"3.50.1"},"reference-count":12,"publisher":"IEEE","license":[{"start":{"date-parts":[[2020,6,1]],"date-time":"2020-06-01T00:00:00Z","timestamp":1590969600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,6,1]],"date-time":"2020-06-01T00:00:00Z","timestamp":1590969600000},"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":[[2020,6]]},"DOI":"10.1109\/isit44484.2020.9174454","type":"proceedings-article","created":{"date-parts":[[2020,8,24]],"date-time":"2020-08-24T17:28:01Z","timestamp":1598290081000},"page":"108-113","source":"Crossref","is-referenced-by-count":3,"title":["Maximum Length of Robust Positioning Sequences"],"prefix":"10.1109","author":[{"given":"Duc Tu","family":"Dao","sequence":"first","affiliation":[{"name":"Nanyang Technological University,School of Physical and Mathematical Sciences,Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Han","family":"Mao Kiah","sequence":"additional","affiliation":[{"name":"Nanyang Technological University,School of Physical and Mathematical Sciences,Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hengjia","family":"Wei","sequence":"additional","affiliation":[{"name":"Ben-Gurion University of the Negev,School of Electrical and Computer Engineering,Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2013.2284512"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1364\/AOP.3.000128"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1201\/9781420010541"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974331.ch136"},{"key":"ref11","article-title":"Reciprocity Laws: from Euler to Eisenstein","author":"lemmermeyer","year":"2000"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/18.149498"},{"key":"ref12","author":"schmidt","year":"1997","journal-title":"Circulant Hadamard matrices Overcoming non-self-conjugacy"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/s00373-007-0779-z"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1137\/19M1253472"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ISMAR.2012.6402593"},{"key":"ref9","author":"macwilliams","year":"1977","journal-title":"The Theory of Error-Correcting Codes"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/70.976017"}],"event":{"name":"2020 IEEE International Symposium on Information Theory (ISIT)","location":"Los Angeles, CA, USA","start":{"date-parts":[[2020,6,21]]},"end":{"date-parts":[[2020,6,26]]}},"container-title":["2020 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9166581\/9173928\/09174454.pdf?arnumber=9174454","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:35:05Z","timestamp":1773347705000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9174454\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6]]},"references-count":12,"URL":"https:\/\/doi.org\/10.1109\/isit44484.2020.9174454","relation":{},"subject":[],"published":{"date-parts":[[2020,6]]}}}