{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,21]],"date-time":"2026-01-21T04:29:06Z","timestamp":1768969746621,"version":"3.49.0"},"reference-count":17,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/wcnc.2003.1200381","type":"proceedings-article","created":{"date-parts":[[2004,1,23]],"date-time":"2004-01-23T23:33:03Z","timestamp":1074900783000},"page":"391-396","source":"Crossref","is-referenced-by-count":85,"title":["A simple approach to near-optimal multiuser detection: interleave-division multiple-access"],"prefix":"10.1109","volume":"1","author":[{"family":"Li Ping","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"family":"Lihai Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"W.K.","family":"Leung","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"17","first-page":"41","article-title":"A heuristic search for good lowdensity parity-check codes at short block lengths","author":"mao","year":"2001","journal-title":"Proc ICC 2001"},{"key":"15","first-page":"1","article-title":"Are turbo-like codes effective on nonstandard channels?","volume":"51","author":"mceliece","year":"2001","journal-title":"IEEE Inform Theory Society Newsletter"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1109\/18.910572"},{"key":"13","author":"ping","year":"0","journal-title":"Low-rate Turbo-Hadamard Codes"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/26.539767"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2002.1115414"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/26.818881"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/26.774855"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/26.737408"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/26.701309"},{"key":"10","first-page":"11","article-title":"Iterative multiuser detection of trellis code multiple access using a posteriori probabilities","author":"brannstrom","year":"2001","journal-title":"Proc ICC 2001"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/18.32152"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/49.942525"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.1013125"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/49.942524"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/4234.957381"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/26.855517"}],"event":{"name":"WCNC 2003 - IEEE Wireless Communications and Networking Conference","location":"New Orleans, LA, USA","acronym":"WCNC-03"},"container-title":["2003 IEEE Wireless Communications and Networking, 2003. WCNC 2003."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/8546\/27028\/01200381.pdf?arnumber=1200381","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,13]],"date-time":"2017-03-13T18:05:48Z","timestamp":1489428348000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1200381\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":17,"URL":"https:\/\/doi.org\/10.1109\/wcnc.2003.1200381","relation":{},"subject":[]}}