{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T15:25:30Z","timestamp":1648740330450},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2011,11,19]],"date-time":"2011-11-19T00:00:00Z","timestamp":1321660800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2013,2]]},"DOI":"10.1007\/s10898-011-9816-9","type":"journal-article","created":{"date-parts":[[2011,11,18]],"date-time":"2011-11-18T04:03:54Z","timestamp":1321589034000},"page":"301-312","source":"Crossref","is-referenced-by-count":2,"title":["Monotonic optimization based decoding for linear codes"],"prefix":"10.1007","volume":"55","author":[{"given":"H. D.","family":"Tuan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"T. T.","family":"Son","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"H.","family":"Tuy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P. T.","family":"Khoa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,11,19]]},"reference":[{"key":"9816_CR1","doi-asserted-by":"crossref","first-page":"384","DOI":"10.1109\/TIT.1978.1055873","volume":"24","author":"E.R. Berlekamp","year":"1978","unstructured":"Berlekamp E.R., McElice R.J., van Tiborg H.C.A.: On the intractibility of certain coding problems. IEEE Trans. Inf. Theory 24, 384\u2013386 (1978)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9816_CR2","doi-asserted-by":"crossref","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, 954\u2013972 (2005)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9816_CR3","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1002\/nav.3800030109","volume":"3","author":"M. Frank","year":"1956","unstructured":"Frank M., Wolfe P.: An algorithm for quadratic programming. Naval Res. Log. Q. 3, 95\u2013110 (1956)","journal-title":"Naval Res. Log. Q."},{"key":"9816_CR4","doi-asserted-by":"crossref","DOI":"10.1109\/TIT.1962.1057683","volume-title":"Low Density Parity Check Codes","author":"R.G. Gallager","year":"1962","unstructured":"Gallager R.G.: Low Density Parity Check Codes. MIT Press, Cambridge (1962)"},{"key":"9816_CR5","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1007\/BF01096415","volume":"3","author":"J. Hasselberg","year":"1993","unstructured":"Hasselberg J., Pardalos P.M., Vairaktarakis G.: Test case generators and computational results for the maximum clique problem. J. Glob. Optim. 3, 463\u2013482 (1993)","journal-title":"J. Glob. Optim."},{"key":"9816_CR6","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1109\/18.910572","volume":"47","author":"F.R. Kschischang","year":"2001","unstructured":"Kschischang F.R., Frey B.J., Loeliger H.A.: Factor graphs and sum-product algorithm. IEEE Trans. Inf. Theory 47, 498\u2013519 (2001)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9816_CR7","unstructured":"LDPC toolkit for Matlab. http:\/\/arun-10.tripod.com\/ldpc\/ldpc.htm"},{"key":"9816_CR8","doi-asserted-by":"crossref","first-page":"1645","DOI":"10.1049\/el:19961141","volume":"32","author":"D.J.C. Mackay","year":"1996","unstructured":"Mackay D.J.C., Neal R.M.: Near Shannon limit performance of low density parity check codes. Electron. Lett. 32, 1645\u20131646 (1996)","journal-title":"Electron. Lett."},{"key":"9816_CR9","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1109\/18.748992","volume":"45","author":"D.J.C. Mackay","year":"1999","unstructured":"Mackay D.J.C.: Good error-correcting codes based on very sparse matrices. IEEE Trans. Inf. Theory 45, 399\u2013431 (1999)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9816_CR10","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/BF02579283","volume":"2","author":"G.A. Margulis","year":"1982","unstructured":"Margulis G.A.: Explicit constructions of graphs without short cycles and low density codes. Combinatorica 2, 71\u201378 (1982)","journal-title":"Combinatorica"},{"key":"9816_CR11","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1109\/49.661103","volume":"16","author":"R. McEliece","year":"1998","unstructured":"McEliece R., MacKay D., Cheng J.: Turbo decoding as an instance of Pearl\u2019s belief propagation algorithm. IEEE J. Sel. Areas Commun. 16, 140\u2013152 (1998)","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"9816_CR12","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/S0377-0427(00)00425-8","volume":"124","author":"P.M. Pardalos","year":"2000","unstructured":"Pardalos P.M., Romeijn E., Tuy H.: Recent developments and trends in global optimization. J. Comput. Appl. Math. 124, 209\u2013228 (2000)","journal-title":"J. Comput. Appl. Math."},{"key":"9816_CR13","volume-title":"Probabilistic Reasoning in Intelligent Systems","author":"J. Pearl","year":"1988","unstructured":"Pearl J.: Probabilistic Reasoning in Intelligent Systems. Margan Kaufmann, Los Altos (1988)"},{"key":"9816_CR14","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1109\/TIT.1981.1056404","volume":"27","author":"R.M. Tanner","year":"1981","unstructured":"Tanner R.M.: A recursive approach to low complexity codes. IEEE Trans. Inf. Theory 27, 533\u2013547 (1981)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9816_CR15","volume-title":"Convex Analysis and Global Optimization","author":"H. Tuy","year":"1999","unstructured":"Tuy H.: Convex Analysis and Global Optimization. Kluwer Academic, New York (1999)"},{"key":"9816_CR16","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1137\/04060932X","volume":"17","author":"H. Tuy","year":"2006","unstructured":"Tuy H., Minoux M., Phuong N.T.H.: Discrete monotonic optimization with application to a discrete location problem. SIAM J. Optim. 17, 78\u201397 (2006)","journal-title":"SIAM J. Optim."},{"key":"9816_CR17","doi-asserted-by":"crossref","first-page":"464","DOI":"10.1137\/S1052623499359828","volume":"11","author":"H. Tuy","year":"2000","unstructured":"Tuy H.: Monotonic optimization: problems and solution approaches. SIAM J. Optim. 11, 464\u2013494 (2000)","journal-title":"SIAM J. Optim."},{"key":"9816_CR18","doi-asserted-by":"crossref","first-page":"1603","DOI":"10.1109\/JSAC.2006.879405","volume":"24","author":"K. Yang","year":"2006","unstructured":"Yang K., Feldman J., Wang X.: Nonlinear progrramming approachs to decoding low-density parity-check codes. IEEE J. Sel. Areas Commun. 24, 1603\u20131613 (2006)","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"9816_CR19","first-page":"239","volume-title":"Exploring Artificial Intelligence in the New Millenium chap 8.","author":"J.S. Yedidia","year":"2003","unstructured":"Yedidia J.S., Freeman W.T., Weiss Y.: Understanding Belief Propagation and its Generalizations. In: Lakemeyer, G., Nebel, B. (eds) Exploring Artificial Intelligence in the New Millenium chap 8., pp. 239\u2013269. Morgan Kaufmann, CA (2003)"},{"key":"9816_CR20","doi-asserted-by":"crossref","first-page":"2282","DOI":"10.1109\/TIT.2005.850085","volume":"51","author":"J.S. Yedidia","year":"2005","unstructured":"Yedidia J.S., Freeman W.T., Weiss Y.: Constructing free-energy approximations and generalized belief propagation algorithms. IEEE Trans. Inf. Theory 51, 2282\u20132312 (2005)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9816_CR21","doi-asserted-by":"crossref","first-page":"1691","DOI":"10.1162\/08997660260028674","volume":"14","author":"A.L. Yuille","year":"2002","unstructured":"Yuille A.L.: CCCP algorithms to minimize the Bethe and Kikuchi energies: convergent alternatives to belief propagation. Neural Comput. 14, 1691\u20131722 (2002)","journal-title":"Neural Comput."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-011-9816-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-011-9816-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-011-9816-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T00:59:00Z","timestamp":1559264340000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-011-9816-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,11,19]]},"references-count":21,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2013,2]]}},"alternative-id":["9816"],"URL":"https:\/\/doi.org\/10.1007\/s10898-011-9816-9","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,11,19]]}}}