{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:41:47Z","timestamp":1725496907386},"reference-count":2,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/isit.2004.1365184","type":"proceedings-article","created":{"date-parts":[[2004,12,23]],"date-time":"2004-12-23T04:34:17Z","timestamp":1103776457000},"page":"147-147","source":"Crossref","is-referenced-by-count":2,"title":["Maximum likelihood decoding of trellis codes in fading channels with no receiver CSI is a polynomial-complexity problem"],"prefix":"10.1109","author":[{"family":"Chun-Hao Hsu","sequence":"first","affiliation":[]},{"given":"A.","family":"Anastasopoulos","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref2","article-title":"Optimal joint detection\/estimation in fading channels with polynomial complexity","author":"motedayen","year":"2003","journal-title":"IEEE Trans Information Theory"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2003.809286"}],"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\/01365184.pdf?arnumber=1365184","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,13]],"date-time":"2017-03-13T23:06:49Z","timestamp":1489446409000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1365184\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":2,"URL":"https:\/\/doi.org\/10.1109\/isit.2004.1365184","relation":{},"subject":[]}}