{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,3]],"date-time":"2024-09-03T18:54:38Z","timestamp":1725389678143},"reference-count":3,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/isit.2004.1365493","type":"proceedings-article","created":{"date-parts":[[2004,12,23]],"date-time":"2004-12-23T09:34:17Z","timestamp":1103794457000},"page":"456-456","source":"Crossref","is-referenced-by-count":0,"title":["Nonintersecting subspaces based on finite alphabets"],"prefix":"10.1109","author":[{"given":"F.E.","family":"Oggier","sequence":"first","affiliation":[]},{"given":"N.J.A.","family":"Sloane","sequence":"additional","affiliation":[]},{"given":"S.N.","family":"Diggavi","sequence":"additional","affiliation":[]},{"given":"R.","family":"Calderbank","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/18.945251"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/18.978730"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/18.825818"}],"event":{"name":"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.","location":"Chicago, Illinois, USA"},"container-title":["International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/9423\/29909\/01365493.pdf?arnumber=1365493","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,15]],"date-time":"2017-03-15T03:47:53Z","timestamp":1489549673000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1365493\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":3,"URL":"https:\/\/doi.org\/10.1109\/isit.2004.1365493","relation":{},"subject":[]}}