{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,11]],"date-time":"2024-01-11T00:08:53Z","timestamp":1704931733050},"reference-count":11,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"8","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Commun."],"published-print":{"date-parts":[[2017]]},"DOI":"10.1587\/transcom.2016fgp0018","type":"journal-article","created":{"date-parts":[[2017,2,7]],"date-time":"2017-02-07T22:09:32Z","timestamp":1486505372000},"page":"1293-1300","source":"Crossref","is-referenced-by-count":2,"title":["Performance Comparison of List Viterbi Algorithm of Tail-Biting Convolutional Code for Future Machine Type Communications"],"prefix":"10.23919","volume":"E100.B","author":[{"given":"Shunichi","family":"BUSHISUE","sequence":"first","affiliation":[{"name":"Kagawa University"}]},{"given":"Satoshi","family":"SUYAMA","sequence":"additional","affiliation":[{"name":"NTT DOCOMO, INC."}]},{"given":"Satoshi","family":"NAGATA","sequence":"additional","affiliation":[{"name":"NTT DOCOMO, INC."}]},{"given":"Nobuhiko","family":"MIKI","sequence":"additional","affiliation":[{"name":"Kagawa University"}]}],"member":"263","reference":[{"key":"1","unstructured":"[1] ITU-R, \u201cM.2083, IMT Vision-Framework and overall objectives of the future development of IMT for 2020 and beyond,\u201d 2015."},{"key":"2","unstructured":"[2] 3G TS 25.212, \u201c3rd Generation Partnership Project; Technical Specification Group Radio Access Network; Multiplexing and channel coding (FDD),\u201d 2000."},{"key":"3","unstructured":"[3] 3GPP, \u201cTR38.913, Study on Scenarios and Requirements for Next Generation Access Technologies,\u201d 2016."},{"key":"4","unstructured":"[4] 3GPP, \u201cDraft Report of 3GPP TSG RAN WG1 #84bis v0.1.0,\u201d 2016."},{"key":"5","doi-asserted-by":"publisher","unstructured":"[5] H. Ma and J. Wolf, \u201cOn tail biting convolutional codes,\u201d IEEE Trans. Commun., vol.34, no.2, pp.104-111, Feb. 1986. 10.1109\/tcom.1986.1096498","DOI":"10.1109\/TCOM.1986.1096498"},{"key":"6","doi-asserted-by":"publisher","unstructured":"[6] R. Cox and C. Sundberg, \u201cAn efficient adaptive circular Viterbi algorithm for decoding generalized tailbiting convolutional codes,\u201d IEEE Trans. Veh. Technol., vol.43, no.1, pp.57-68, 1994. 10.1109\/25.282266","DOI":"10.1109\/25.282266"},{"key":"7","doi-asserted-by":"publisher","unstructured":"[7] N. Seshadri and C.E. Sundberg, \u201cList Viterbi decoding algorithms with applications,\u201d IEEE Trans. Commun., vol.42, no.2\/3\/4, pp.313-323, Feb. 1994. 10.1109\/tcomm.1994.577040","DOI":"10.1109\/TCOMM.1994.577040"},{"key":"8","doi-asserted-by":"crossref","unstructured":"[8] M. Mohammad, H. Ramchandran, J.H. Jong, C. Ravishankar, and C. Barnett, \u201cComparing list Viterbi algorithms with and without tail bits,\u201d MILCOM 2008-2008 IEEE Mil. Commun. Conf., pp.1-6, IEEE, Nov. 2008. 10.1109\/milcom.2008.4753303","DOI":"10.1109\/MILCOM.2008.4753303"},{"key":"9","doi-asserted-by":"crossref","unstructured":"[9] S.V. Fedorenko, M. Trefilov, and Y. Wei, \u201cImproved list decoding of tail-biting convolutional codes,\u201d 2014 XIV Int. Symp. Probl. Redundancy Inf. Control Syst., pp.35-38, IEEE, June 2014. 10.1109\/red.2014.7016717","DOI":"10.1109\/RED.2014.7016717"},{"key":"10","doi-asserted-by":"crossref","unstructured":"[10] Qualcomm, \u201cR1-162213, TBCC-HARQ, rate,\u201d 2016.","DOI":"10.1007\/978-1-4614-6438-9_101508-1"},{"key":"11","unstructured":"[11] S. Bushisue, S. Suyama, S. Nagata, and N. Miki, \u201cPerformance evaluation of convolutional code with list decoding for 5G machine type communications,\u201d 2016 IEEE Veh. Technol. Soc. Asia Pacific Wirel. Commun. Symp. (APWCS 2016), C1-1, 2016."}],"container-title":["IEICE Transactions on Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transcom\/E100.B\/8\/E100.B_2016FGP0018\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,10]],"date-time":"2024-01-10T15:00:52Z","timestamp":1704898852000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transcom\/E100.B\/8\/E100.B_2016FGP0018\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"references-count":11,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2017]]}},"URL":"https:\/\/doi.org\/10.1587\/transcom.2016fgp0018","relation":{},"ISSN":["0916-8516","1745-1345"],"issn-type":[{"value":"0916-8516","type":"print"},{"value":"1745-1345","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]}}}