{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T15:25:04Z","timestamp":1729610704429,"version":"3.28.0"},"reference-count":3,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/isit.2004.1365375","type":"proceedings-article","created":{"date-parts":[[2004,12,23]],"date-time":"2004-12-23T09:34:17Z","timestamp":1103794457000},"page":"338-338","source":"Crossref","is-referenced-by-count":5,"title":["Designs and full-rank STBCs from DFT domain description of cyclic codes"],"prefix":"10.1109","author":[{"given":"U.","family":"Sripati","sequence":"first","affiliation":[]},{"given":"V.","family":"Shashidhar","sequence":"additional","affiliation":[]},{"given":"B.S.","family":"Rajan","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref3","doi-asserted-by":"crossref","first-page":"2757","DOI":"10.1109\/TIT.2003.818023","article-title":"Maximum Rank Distance Codes as Space Time Codes","volume":"49","author":"paul","year":"2003","journal-title":"IEEE Trans on Information Theory"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/18.825816"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2003.1228086"}],"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\/01365375.pdf?arnumber=1365375","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,16]],"date-time":"2017-06-16T13:43:01Z","timestamp":1497620581000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1365375\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":3,"URL":"https:\/\/doi.org\/10.1109\/isit.2004.1365375","relation":{},"subject":[]}}