{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,14]],"date-time":"2025-02-14T05:24:50Z","timestamp":1739510690126,"version":"3.37.0"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642108679"},{"type":"electronic","value":"9783642108686"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-10868-6_2","type":"book-chapter","created":{"date-parts":[[2009,12,2]],"date-time":"2009-12-02T05:17:15Z","timestamp":1259731035000},"page":"22-37","source":"Crossref","is-referenced-by-count":0,"title":["On Linear Programming Decoding on a Quantized Additive White Gaussian Noise Channel"],"prefix":"10.1007","author":[{"given":"Eirik","family":"Rosnes","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"Berrou, C., Glavieux, A., Thitimajshima, P.: Near Shannon limit error-correcting coding and decoding: Turbo-codes. In: Proc. IEEE Int. Conf. Commun. (ICC), Geneva, Switzerland, pp. 1064\u20131070 (May 1993)","DOI":"10.1109\/ICC.1993.397441"},{"issue":"1","key":"2_CR2","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1109\/TIT.1962.1057683","volume":"8","author":"R.G. Gallager","year":"1962","unstructured":"Gallager, R.G.: Low-density parity-check codes. IRE Trans. Inf. Theory\u00a08(1), 21\u201328 (1962)","journal-title":"IRE Trans. Inf. Theory"},{"issue":"2","key":"2_CR3","doi-asserted-by":"publisher","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\u00a045(2), 399\u2013431 (1999)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"6","key":"2_CR4","doi-asserted-by":"publisher","first-page":"1570","DOI":"10.1109\/TIT.2002.1003839","volume":"48","author":"C. Di","year":"2002","unstructured":"Di, C., Proietti, D., Telatar, I.E., Richardson, T.J., Urbanke, R.L.: Finite-length analysis of low-density parity-check codes on the binary erasure channel. IEEE Trans. Inf. Theory\u00a048(6), 1570\u20131579 (2002)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"2_CR5","doi-asserted-by":"publisher","first-page":"922","DOI":"10.1109\/TIT.2005.864441","volume":"52","author":"M. Schwartz","year":"2006","unstructured":"Schwartz, M., Vardy, A.: On the stopping distance and the stopping redundancy of codes. IEEE Trans. Inf. Theory\u00a052(3), 922\u2013932 (2006)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"2_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\u00a051(3), 954\u2013972 (2005)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"2_CR7","unstructured":"Vontobel, P.O., Koetter, R.: Graph-cover decoding and finite-length analysis of message-passing iterative decoding of LDPC codes. IEEE Trans. Inf. Theory (to appear), http:\/\/arxiv.org\/abs\/cs.IT\/0512078\/"},{"key":"2_CR8","series-title":"IMA Vol. Math. Appl.","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1007\/978-1-4613-0165-3_5","volume-title":"Codes, Systems, and Graphical Models","author":"G.D. Forney Jr.","year":"2001","unstructured":"Forney Jr., G.D., Koetter, R., Kschischang, F.R., Reznik, A.: On the effective weights of pseudocodewords for codes defined on graphs with cycles. In: Marcus, B., Rosenthal, J. (eds.) Codes, Systems, and Graphical Models. IMA Vol. Math. Appl., vol.\u00a0123, pp. 101\u2013112. Springer, Heidelberg (2001)"},{"issue":"7","key":"2_CR9","doi-asserted-by":"publisher","first-page":"2942","DOI":"10.1109\/TIT.2009.2021338","volume":"55","author":"E. Rosnes","year":"2009","unstructured":"Rosnes, E.: On the pairwise error probability of linear programming decoding on independent Rayleigh flat-fading channels. IEEE Trans. Inf. Theory\u00a055(7), 2942\u20132955 (2009)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"2_CR10","doi-asserted-by":"crossref","unstructured":"Feldman, J., Koetter, R., Vontobel, P.O.: The benefit of thresholding in LP decoding of LDPC codes. In: Proc. IEEE Int. Symp. Inf. Theory (ISIT), Adelaide, SA, Australia, pp. 307\u2013311 (September 2005)","DOI":"10.1109\/ISIT.2005.1523344"},{"issue":"11","key":"2_CR11","doi-asserted-by":"publisher","first-page":"4013","DOI":"10.1109\/TIT.2007.907501","volume":"53","author":"C.A. Kelley","year":"2007","unstructured":"Kelley, C.A., Sridhara, D.: Pseudocodewords of Tanner graphs. IEEE Trans. Inf. Theory\u00a053(11), 4013\u20134038 (2007)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"2_CR12","unstructured":"Rosnes, E.: On the connection between finite graph covers, pseudo-codewords, and linear programming decoding of turbo codes. In: Proc. 4th Int. Symp. Turbo Codes & Related Topics, Munich, Germany (April 2006)"},{"key":"2_CR13","unstructured":"Feldman, J.: Decoding Error-Correcting Codes via Linear Programming. PhD thesis, Dept. of Electrical Engineering and Computer Science, Massachusetts Institute of Technology (MIT), Cambridge, MA (2003)"},{"key":"2_CR14","unstructured":"Tanner, R.M., Sridhara, D., Fuja, T.: A class of group-structured LDPC codes. In: Proc. Int. Symp. Commun. Theory and Appl (ISCTA), Ambleside, UK (July 2001)"},{"key":"2_CR15","unstructured":"Chilappagari, S.K., Chertkov, M., Vasic, B.: Provably efficient instanton search algorithm for LP decoding of LDPC codes over the BSC. IEEE Trans. Inf. Theory (submitted for publication) (2008), http:\/\/arxiv.org\/abs\/0808.2515\/"},{"issue":"4","key":"2_CR16","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\u00a054(4), 1514\u20131520 (2008)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"9","key":"2_CR17","doi-asserted-by":"publisher","first-page":"4167","DOI":"10.1109\/TIT.2009.2025573","volume":"55","author":"E. Rosnes","year":"2009","unstructured":"Rosnes, E., Ytrehus, \u00d8.: An efficient algorithm to find all small-size stopping sets of low-density parity-check matrices. IEEE Trans. Inf. Theory\u00a055(9), 4167\u20134178 (2009)","journal-title":"IEEE Trans. Inf. Theory"}],"container-title":["Lecture Notes in Computer Science","Cryptography and Coding"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-10868-6_2.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,13]],"date-time":"2025-02-13T15:24:06Z","timestamp":1739460246000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-10868-6_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642108679","9783642108686"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-10868-6_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}