{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:53:54Z","timestamp":1773377634681,"version":"3.50.1"},"reference-count":9,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,7]]},"DOI":"10.1109\/isit.2019.8849803","type":"proceedings-article","created":{"date-parts":[[2019,9,26]],"date-time":"2019-09-26T21:46:12Z","timestamp":1569534372000},"page":"31-35","source":"Crossref","is-referenced-by-count":3,"title":["Backtracking and Look-Ahead Decoding Algorithms for Improved Successive Cancellation Decoding Performance of Polar Codes"],"prefix":"10.1109","author":[{"given":"Myna","family":"Vajha","sequence":"first","affiliation":[{"name":"Department of Electrical Communication Engineering, Indian Institute of Science, Bangalore"}]},{"given":"V. S.","family":"Chaitanya Mukka","sequence":"additional","affiliation":[{"name":"Department of Electrical Communication Engineering, Indian Institute of Science, Bangalore"}]},{"given":"P.","family":"Vijay Kumar","sequence":"additional","affiliation":[{"name":"Department of Electrical Communication Engineering, Indian Institute of Science, Bangalore"}]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2014.2323237"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1049\/el.2012.1459"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2016.7471817"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2013.070213.120789"},{"key":"ref8","article-title":"Tree traversal","year":"0"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437559"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2410251"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/VTCSpring.2018.8417497"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2021379"}],"event":{"name":"2019 IEEE International Symposium on Information Theory (ISIT)","location":"Paris, France","start":{"date-parts":[[2019,7,7]]},"end":{"date-parts":[[2019,7,12]]}},"container-title":["2019 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8827389\/8849208\/08849803.pdf?arnumber=8849803","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:34:42Z","timestamp":1773347682000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8849803\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7]]},"references-count":9,"URL":"https:\/\/doi.org\/10.1109\/isit.2019.8849803","relation":{},"subject":[],"published":{"date-parts":[[2019,7]]}}}