{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T03:27:15Z","timestamp":1648956435774},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"9-10","license":[{"start":{"date-parts":[[2013,10,19]],"date-time":"2013-10-19T00:00:00Z","timestamp":1382140800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann. Telecommun."],"published-print":{"date-parts":[[2014,10]]},"DOI":"10.1007\/s12243-013-0400-9","type":"journal-article","created":{"date-parts":[[2013,10,18]],"date-time":"2013-10-18T03:00:12Z","timestamp":1382065212000},"page":"529-537","source":"Crossref","is-referenced-by-count":1,"title":["An efficiently implementable maximum likelihood decoding algorithm for tailbiting codes"],"prefix":"10.1007","volume":"69","author":[{"given":"Jorge","family":"Ort\u00edn","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paloma Garc\u00eda","family":"D\u00facar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fernando","family":"Guti\u00e9rrez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Antonio","family":"Valdovinos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,10,19]]},"reference":[{"key":"400_CR1","unstructured":"ETSI (2013) 3GPP TS 36.212 v. 11.3.0. LTE evolved universal terrestrial radio access (E-UTRA): multiplexing and channel coding. ETSI, Sophia Antipolis Cedex"},{"key":"400_CR2","unstructured":"IEEE (2009) IEEE 802.16-2009. Air interface for fixed and mobile broadband wireless access system. IEEE, New York"},{"issue":"2","key":"400_CR3","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1109\/TCOM.1986.1096498","volume":"34","author":"HH Ma","year":"1986","unstructured":"Ma HH, Wolf JK (1986) On tail biting convolutional codes. IEEE Trans Commun 34(2):104\u2013111","journal-title":"IEEE Trans Commun"},{"issue":"2","key":"400_CR4","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1109\/25.282266","volume":"43","author":"RV Cox","year":"1994","unstructured":"Cox RV, Sundberg CW (1994) An efficient adaptative circular Viterbi algorithm for decoding generalized tailbiting convolutional codes. IEEE Trans Veh Tech 43(2):57\u201368","journal-title":"IEEE Trans Veh Tech"},{"issue":"10","key":"400_CR5","doi-asserted-by":"crossref","first-page":"1658","DOI":"10.1109\/TCOMM.2003.818084","volume":"51","author":"RY Shao","year":"2003","unstructured":"Shao RY, Lin S, Fossorier MPC (2003) Two decoding algorithms for tailbiting codes. IEEE Trans Commun 51(10):1658\u2013 1665","journal-title":"IEEE Trans Commun"},{"issue":"11","key":"400_CR6","first-page":"1736","volume":"50","author":"JB Anderson","year":"2002","unstructured":"Anderson JB, Hladik SM (2002) An optimal circular Viterbi decoder for the bounded distance criterion. IEEE J Sel Areas Commun 50(11):1736\u20131742","journal-title":"IEEE J Sel Areas Commun"},{"issue":"7","key":"400_CR7","doi-asserted-by":"crossref","first-page":"510","DOI":"10.1109\/LCOMM.2009.090810","volume":"13","author":"Ortin","year":"2009","unstructured":"Ortin et al (2009) Two step SOVA-based decoding algorithm for tailbiting codes. IEEE Commun Lett 13(7):510\u2013 512","journal-title":"IEEE Commun Lett"},{"key":"400_CR8","doi-asserted-by":"crossref","unstructured":"Hagenauer J, Hoeher P (1989) A Viterbi algorithm with soft-decision outputs and its applications. In: Proceedings of the IEEE GLOBECOM, Dallas","DOI":"10.1109\/GLOCOM.1989.64230"},{"issue":"12","key":"400_CR9","doi-asserted-by":"crossref","first-page":"883","DOI":"10.1109\/LCOMM.2008.072181","volume":"12","author":"H-T Pai","year":"2008","unstructured":"Pai H-T, et al (2008) Low-complexity ML decoding for convolutional tail-biting codes. IEEE Commun Lett 12(12):883\u2013885","journal-title":"IEEE Commun Lett"},{"issue":"9","key":"400_CR10","doi-asserted-by":"crossref","first-page":"854","DOI":"10.1109\/LCOMM.2010.072310.100295","volume":"14","author":"J Ortin","year":"2010","unstructured":"Ortin J, et al (2010) A low complexity maximum likelihood decoder for tailbiting trellis. IEEE Commun Lett 14(9):854\u2013 856","journal-title":"IEEE Commun Lett"},{"issue":"4","key":"400_CR11","doi-asserted-by":"crossref","first-page":"1212","DOI":"10.1109\/TCOMM.2013.020813.120275","volume":"16","author":"X Wang","year":"2013","unstructured":"Wang X, et al (2013) An efficient ML decoder for tail-biting codes based on circular trap detection. IEEE Trans Commun 16(4):1212\u20131221","journal-title":"IEEE Trans Commun"},{"key":"400_CR12","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1007\/s12243-012-0295-x","volume":"67","author":"RD Souza","year":"2012","unstructured":"Souza RD, Pimentel C, Muniz DN (2012) Reduced complexity decoding of convolutional codes based on the M-algorithm and the minimal trellis. Ann Telecommun 67:537\u2013545","journal-title":"Ann Telecommun"}],"container-title":["annals of telecommunications - annales des t\u00e9l\u00e9communications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12243-013-0400-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12243-013-0400-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12243-013-0400-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T02:38:09Z","timestamp":1559443089000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12243-013-0400-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,10,19]]},"references-count":12,"journal-issue":{"issue":"9-10","published-print":{"date-parts":[[2014,10]]}},"alternative-id":["400"],"URL":"https:\/\/doi.org\/10.1007\/s12243-013-0400-9","relation":{},"ISSN":["0003-4347","1958-9395"],"issn-type":[{"value":"0003-4347","type":"print"},{"value":"1958-9395","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,10,19]]}}}