{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:20:30Z","timestamp":1740122430548,"version":"3.37.3"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2021,9,14]],"date-time":"2021-09-14T00:00:00Z","timestamp":1631577600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,9,14]],"date-time":"2021-09-14T00:00:00Z","timestamp":1631577600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100004410","name":"T\u00fcrkiye Bilimsel ve Teknolojik Arastirma Kurumu","doi-asserted-by":"publisher","award":["113M499"],"award-info":[{"award-number":["113M499"]}],"id":[{"id":"10.13039\/501100004410","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2021,11]]},"DOI":"10.1007\/s10898-021-01073-4","type":"journal-article","created":{"date-parts":[[2021,9,14]],"date-time":"2021-09-14T04:02:26Z","timestamp":1631592146000},"page":"805-834","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A branch-cut-and-price algorithm for optimal decoding in digital communication systems"],"prefix":"10.1007","volume":"81","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8613-3266","authenticated-orcid":false,"given":"Banu","family":"Kabakulak","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Z. Caner","family":"Ta\u015fk\u0131n","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ali Emre","family":"Pusane","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,9,14]]},"reference":[{"issue":"6","key":"1073_CR1","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1109\/LCOMM.2008.080017","volume":"12","author":"E Arikan","year":"2008","unstructured":"Arikan, E.: A performance comparison of polar codes and reed-Muller codes. IEEE Commun. Lett. 12(6), 447\u2013449 (2008)","journal-title":"IEEE Commun. Lett."},{"issue":"12","key":"1073_CR2","doi-asserted-by":"publisher","first-page":"7870","DOI":"10.1109\/TIT.2013.2281372","volume":"59","author":"S Barman","year":"2013","unstructured":"Barman, S., Liu, X., Draper, S.C., Recht, B.: Decomposition methods for large scale LP decoding. IEEE Trans. Inf. Theory 59(12), 7870\u20137886 (2013)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"1073_CR3","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1109\/TIT.1978.1055873","volume":"24","author":"E Berlekamp","year":"1978","unstructured":"Berlekamp, E., McEliece, R., Van Tilborg, H.: On the inherent intractability of certain coding problems. IEEE Trans. Inf. Theory 24(3), 384\u2013386 (1978)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"11","key":"1073_CR4","doi-asserted-by":"publisher","first-page":"4835","DOI":"10.1109\/TIT.2009.2030477","volume":"55","author":"D Burshtein","year":"2009","unstructured":"Burshtein, D.: Iterative approximate linear programming decoding of LDPC codes with linear complexity. IEEE Trans. Inf. Theory 55(11), 4835\u20134859 (2009)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"1073_CR5","doi-asserted-by":"publisher","first-page":"1514","DOI":"10.1109\/TIT.2008.917682","volume":"54","author":"M Chertkov","year":"2008","unstructured":"Chertkov, M., Stepanov, M.G.: An efficient pseudocodeword search algorithm for linear programming decoding of LDPC codes. IEEE Trans. Inf. Theory 54(4), 1514\u20131520 (2008)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"1073_CR6","doi-asserted-by":"publisher","first-page":"954","DOI":"10.1109\/TIT.2004.842696","volume":"51","author":"J Feldman","year":"2005","unstructured":"Feldman, J., Wainwright, M.J., Karger, D.R.: Using linear programming to decode binary linear codes. IEEE Trans. Inf. Theory 51(3), 954\u2013972 (2005)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"5","key":"1073_CR7","doi-asserted-by":"publisher","first-page":"673","DOI":"10.1109\/26.768759","volume":"47","author":"MP Fossorier","year":"1999","unstructured":"Fossorier, M.P., Mihaljevic, M., Imai, H.: Reduced complexity iterative decoding of low-density parity check codes based on belief propagation. IEEE Trans. Commun. 47(5), 673\u2013680 (1999)","journal-title":"IEEE Trans. Commun."},{"issue":"1","key":"1073_CR8","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1109\/TIT.1962.1057683","volume":"8","author":"R Gallager","year":"1962","unstructured":"Gallager, R.: Low-density parity-check codes. IRE Trans. Inf. Theory 8(1), 21\u201328 (1962)","journal-title":"IRE Trans. Inf. Theory"},{"key":"1073_CR9","doi-asserted-by":"crossref","unstructured":"Hu, X.-Y., Eleftheriou, E., Arnold, D.-M., and Dholakia, A.:Efficient implementations of the sum-product algorithm for decoding LDPC codes. In: GLOBECOM\u201901. IEEE Global Telecommunications Conference (Cat. No. 01CH37270), vol.\u00a02, pp. 1036\u20131036E. IEEE (2001)","DOI":"10.1109\/GLOCOM.2001.965575"},{"issue":"1","key":"1073_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/opre.2013.1235","volume":"62","author":"DR Karger","year":"2014","unstructured":"Karger, D.R., Oh, S., Shah, D.: Budget-optimal task allocation for reliable crowdsourcing systems. Oper. Res. 62(1), 1\u201324 (2014)","journal-title":"Oper. Res."},{"issue":"2","key":"1073_CR11","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1109\/18.910572","volume":"47","author":"FR Kschischang","year":"2001","unstructured":"Kschischang, F.R., Frey, B.J., Loeliger, H.-A., et al.: Factor graphs and the sum-product algorithm. IEEE Trans. Inf. Theory 47(2), 498\u2013519 (2001)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1073_CR12","doi-asserted-by":"crossref","unstructured":"Lau, F.\u00a0C., Mo, F., Tarn, W.\u00a0M., Sham, C.-W.: Random-permutation-matrix-based cyclically-coupled LDPC codes. In: 2017 19th International Conference on Advanced Communication Technology (ICACT), pp. 497\u2013500. IEEE (2017)","DOI":"10.23919\/ICACT.2017.7890139"},{"key":"1073_CR13","doi-asserted-by":"crossref","unstructured":"Leiner, B.M.: LDPC codes\u2014a brief tutorial. 8:1\u20139 (2005)","DOI":"10.1137\/1.9780898717891.ch1"},{"key":"1073_CR14","doi-asserted-by":"crossref","unstructured":"L\u00fcbbecke, M.E.: Column generation. Wiley. In: Wiley Encyclopedia of Operations Research and Management Science (2010)","DOI":"10.1002\/9780470400531.eorms0158"},{"issue":"6","key":"1073_CR15","doi-asserted-by":"publisher","first-page":"1007","DOI":"10.1287\/opre.1050.0234","volume":"53","author":"ME L\u00fcbbecke","year":"2005","unstructured":"L\u00fcbbecke, M.E., Desrosiers, J.: Selected topics in column generation. Oper. Res. 53(6), 1007\u20131023 (2005)","journal-title":"Oper. Res."},{"issue":"2","key":"1073_CR16","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1109\/18.748992","volume":"45","author":"DJ MacKay","year":"1999","unstructured":"MacKay, D.J.: Good error-correcting codes based on very sparse matrices. IEEE Trans. Inf. Theory 45(2), 399\u2013431 (1999)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1073_CR17","volume-title":"Information Theory, Inference and Learning Algorithms","author":"DJ MacKay","year":"2003","unstructured":"MacKay, D.J.: Information Theory, Inference and Learning Algorithms. Cambridge University Press, Cambridge (2003)"},{"issue":"6","key":"1073_CR18","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1049\/el:19970362","volume":"33","author":"DJ MacKay","year":"1997","unstructured":"MacKay, D.J., Neal, R.M.: Near Shannon limit performance of low density parity check codes. Electron. Lett. 33(6), 457\u2013458 (1997)","journal-title":"Electron. Lett."},{"key":"1073_CR19","doi-asserted-by":"publisher","DOI":"10.1002\/0471739219","volume-title":"Error Correction Coding: Mathematical Methods and Algorithms","author":"TK Moon","year":"2005","unstructured":"Moon, T.K.: Error Correction Coding: Mathematical Methods and Algorithms. Wiley, New York (2005)"},{"issue":"2","key":"1073_CR20","doi-asserted-by":"publisher","first-page":"599","DOI":"10.1109\/18.910577","volume":"47","author":"TJ Richardson","year":"2001","unstructured":"Richardson, T.J., Urbanke, R.L.: The capacity of low-density parity-check codes under message-passing decoding. IEEE Trans. Inf. Theory 47(2), 599\u2013618 (2001)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1073_CR21","doi-asserted-by":"crossref","unstructured":"Sarajli\u0107, M., Liu, L., and Edfors, O.: Reducing the complexity of LDPC decoding algorithms: An optimization-oriented approach. In: 2014 IEEE 25th Annual International Symposium on Personal, Indoor, and Mobile Radio Communication (PIMRC), pp. 861\u2013866. IEEE (2014)","DOI":"10.1109\/PIMRC.2014.7136286"},{"issue":"7","key":"1073_CR22","doi-asserted-by":"publisher","first-page":"3277","DOI":"10.1109\/TIT.2010.2048489","volume":"56","author":"A Tanatmis","year":"2010","unstructured":"Tanatmis, A., Ruzika, S., Hamacher, H.W., Punekar, M., Kienle, F., Wehn, N.: A separation algorithm for improved LP-decoding of linear block codes. IEEE Trans. Inf. Theory 56(7), 3277\u20133289 (2010)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"5","key":"1073_CR23","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1109\/TIT.1981.1056404","volume":"27","author":"R Tanner","year":"1981","unstructured":"Tanner, R.: A recursive approach to low complexity codes. IEEE Trans. Inf. Theory 27(5), 533\u2013547 (1981)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"5","key":"1073_CR24","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1002\/ett.1184","volume":"18","author":"PO Vontobel","year":"2007","unstructured":"Vontobel, P.O., Koetter, R.: On low-complexity linear-programming decoding of LDPC codes. Eur. Trans. Telecommun. 18(5), 509\u2013517 (2007)","journal-title":"Eur. Trans. Telecommun."},{"issue":"8","key":"1073_CR25","doi-asserted-by":"publisher","first-page":"1603","DOI":"10.1109\/JSAC.2006.879405","volume":"24","author":"K Yang","year":"2006","unstructured":"Yang, K., Feldman, J., Wang, X.: Nonlinear programming approaches to decoding low-density parity-check codes. IEEE J. Sel. Areas Commun. 24(8), 1603\u20131613 (2006)","journal-title":"IEEE J. Sel. Areas Commun."},{"issue":"3","key":"1073_CR26","doi-asserted-by":"publisher","first-page":"1061","DOI":"10.1109\/TIT.2007.915712","volume":"54","author":"K Yang","year":"2008","unstructured":"Yang, K., Wang, X., Feldman, J.: A new linear programming approach to decoding linear block codes. IEEE Trans. Inf. Theory 54(3), 1061\u20131072 (2008)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"10","key":"1073_CR27","doi-asserted-by":"publisher","first-page":"6581","DOI":"10.1109\/TIT.2012.2204955","volume":"58","author":"X Zhang","year":"2012","unstructured":"Zhang, X., Siegel, P.H.: Adaptive cut generation algorithm for improved linear programming decoding of binary linear codes. IEEE Trans. Inf. Theory 58(10), 6581\u20136594 (2012)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1073_CR28","doi-asserted-by":"crossref","unstructured":"Zhang, X., Siegel, P.H.: Efficient iterative LP decoding of LDPC codes with alternating direction method of multipliers. In: 2013 IEEE International Symposium on Information Theory, pp. 1501\u20131505. IEEE (2013)","DOI":"10.1109\/ISIT.2013.6620477"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-021-01073-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10898-021-01073-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-021-01073-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T09:02:05Z","timestamp":1725786125000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10898-021-01073-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,9,14]]},"references-count":28,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2021,11]]}},"alternative-id":["1073"],"URL":"https:\/\/doi.org\/10.1007\/s10898-021-01073-4","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"type":"print","value":"0925-5001"},{"type":"electronic","value":"1573-2916"}],"subject":[],"published":{"date-parts":[[2021,9,14]]},"assertion":[{"value":"12 July 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 August 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 September 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}