{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T08:56:39Z","timestamp":1729673799840,"version":"3.28.0"},"reference-count":14,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009,6]]},"DOI":"10.1109\/icc.2009.5199221","type":"proceedings-article","created":{"date-parts":[[2009,8,11]],"date-time":"2009-08-11T16:20:30Z","timestamp":1250007630000},"page":"1-6","source":"Crossref","is-referenced-by-count":2,"title":["New Constructions of Low-Complexity Convolutional Codes"],"prefix":"10.1109","author":[{"given":"A.","family":"Katsiotis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P.","family":"Rizomiliotis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"N.","family":"Kalouptsidis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2005.1576591"},{"key":"14","article-title":"binary convolutional codes of high rate","author":"ytrehus","year":"1992","journal-title":"Department report Depart of Inform"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1983.1056727"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1016\/j.jco.2003.08.018"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/18.623175"},{"key":"2","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1109\/TIT.1979.1055999","article-title":"punctured convolutional codes of rate (n-1)\/n and simplified maximum likelihood decoding","volume":"it 25","author":"cain","year":"1979","journal-title":"IEEE Trans Inform Theory"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/18.605600"},{"year":"0","key":"10"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/26.7536"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/26.46505"},{"key":"5","doi-asserted-by":"crossref","first-page":"794","DOI":"10.1109\/TIT.1982.1056558","article-title":"new short constraint length convolutional codes construction for selected rational rates","volume":"it 28","author":"daut","year":"1982","journal-title":"IEEE Trans Inform Theory"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/18.556606"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/18.556680"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/18.508834"}],"event":{"name":"ICC 2009 - 2009 IEEE International Conference on Communications","start":{"date-parts":[[2009,6,14]]},"location":"Dresden, Germany","end":{"date-parts":[[2009,6,18]]}},"container-title":["2009 IEEE International Conference on Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5198563\/5198564\/05199221.pdf?arnumber=5199221","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,18]],"date-time":"2017-06-18T18:44:44Z","timestamp":1497811484000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5199221\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,6]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/icc.2009.5199221","relation":{},"subject":[],"published":{"date-parts":[[2009,6]]}}}