{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T03:29:17Z","timestamp":1729654157091,"version":"3.28.0"},"reference-count":15,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,6]]},"DOI":"10.1109\/isit.2017.8006758","type":"proceedings-article","created":{"date-parts":[[2017,8,29]],"date-time":"2017-08-29T14:54:37Z","timestamp":1504018477000},"page":"1396-1400","source":"Crossref","is-referenced-by-count":1,"title":["Geometric orthogonal codes better than optical orthogonal codes"],"prefix":"10.1109","author":[{"given":"Yeow Meng","family":"Chee","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Han Mao","family":"Kiah","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"San","family":"Ling","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hengjia","family":"Wei","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"journal-title":"Asymptotically optimal optical orthogonal signature pattern codes","year":"0","author":"ji","key":"ref10"},{"key":"ref11","doi-asserted-by":"crossref","first-page":"3072","DOI":"10.1109\/TIT.2003.818387","article-title":"A new recursive construction for optical orthogonal codes","volume":"49","author":"chu","year":"2003","journal-title":"IEEE Trans Inform Theory"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1023\/B:DESI.0000029212.52214.71"},{"key":"ref13","first-page":"135","article-title":"On a combinatorial problem of antennas in radioastronomy","volume":"18","author":"bermond","year":"1978","journal-title":"Combinatorics (Proc Fifth Hungarian Colloq Keszthely 1976) Vol I"},{"key":"ref14","doi-asserted-by":"crossref","DOI":"10.1201\/9781420049954","author":"colbourn","year":"1996","journal-title":"The CRC Handbook of Combinatorial Designs"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1002\/jcd.20259"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/18.30982"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TMBMC.2017.2668382"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-5531-5_5"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/BF01191203"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/26.486611"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/49.286683"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1038\/nchem.1070"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1038\/nature04586"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1962.1057714"}],"event":{"name":"2017 IEEE International Symposium on Information Theory (ISIT)","start":{"date-parts":[[2017,6,25]]},"location":"Aachen, Germany","end":{"date-parts":[[2017,6,30]]}},"container-title":["2017 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7999336\/8006474\/08006758.pdf?arnumber=8006758","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,2]],"date-time":"2019-10-02T18:20:06Z","timestamp":1570040406000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8006758\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/isit.2017.8006758","relation":{},"subject":[],"published":{"date-parts":[[2017,6]]}}}