{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T10:47:42Z","timestamp":1725533262674},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642018138"},{"type":"electronic","value":"9783642018770"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-01877-0_11","type":"book-chapter","created":{"date-parts":[[2009,6,6]],"date-time":"2009-06-06T07:01:52Z","timestamp":1244271712000},"page":"107-123","source":"Crossref","is-referenced-by-count":4,"title":["Recent Developments in Low-Density Parity-Check Codes"],"prefix":"10.1007","author":[{"given":"Wen-Ching Winnie","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Min","family":"Lu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chenying","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"11_CR1","unstructured":"Arslan, O.: The dimension of LU(3,q) codes (preprint) (2008), \n                  \n                    http:\/\/arxiv.org\/abs\/0802.0015"},{"key":"11_CR2","volume-title":"Computing the Continuous Discretely : integer-point enumeration in polyhedra","author":"M. Beck","year":"2007","unstructured":"Beck, M., Robins, S.: Computing the Continuous Discretely: integer-point enumeration in polyhedra. Springer, New York (2007)"},{"key":"11_CR3","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. Inform. Theory\u00a08, 21\u201328 (1962)","journal-title":"IRE Trans. Inform. Theory"},{"key":"11_CR4","doi-asserted-by":"publisher","first-page":"2378","DOI":"10.1109\/TIT.2004.834760","volume":"50","author":"J.-L. Kim","year":"2004","unstructured":"Kim, J.-L., Peled, U.N., Perepelitsa, I., Pless, V., Friedl, S.: Explicit construction of families of LDPC codes with no 4-cycles. IEEE Trans. Inform. Theory\u00a050, 2378\u20132388 (2004)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"Koetter, R., Li, W.-C.W., Vontobel, P.O., Walker, J.L.: Pseudo-codewords of cycle codes via zeta functions. In: Proc. IEEE Inform. Theory Workshop, San Antonio, TX, USA, pp. 7\u201312 (2004)","DOI":"10.1109\/ITW.2004.1405265"},{"key":"11_CR6","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/j.aim.2006.12.010","volume":"213","author":"R. Koetter","year":"2007","unstructured":"Koetter, R., Li, W.-C.W., Vontobel, P.O., Walker, J.L.: Characterizations of pseudo-codewords of (low-density) parity check codes. Adv. in Math.\u00a0213, 205\u2013229 (2007)","journal-title":"Adv. in Math."},{"key":"11_CR7","unstructured":"Koetter, R., Vontobel, P.O.: Graph covers and iterative decoding of finite-length codes. In: Proc. 3rd Intern.\u00a0Conf.\u00a0on Turbo Codes and Related Topics, Brest, France, pp. 75\u201382 (2003)"},{"key":"11_CR8","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1016\/0166-218X(94)00058-L","volume":"60","author":"F. Lazebnik","year":"1997","unstructured":"Lazebnik, F., Ustimenko, V.A.: Explicit construction of graphs with arbitrary large girth and of largh size. Discrete Applied Math.\u00a060, 275\u2013284 (1997)","journal-title":"Discrete Applied Math."},{"key":"11_CR9","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1109\/MSP.2004.1267047","volume":"21","author":"H.-A. Loeliger","year":"2004","unstructured":"Loeliger, H.-A.: An introduction to factor graphs. IEEE Sig. Proc. Mag.\u00a021, 28\u201344 (2004)","journal-title":"IEEE Sig. Proc. Mag."},{"key":"11_CR10","unstructured":"Lu, M.: Low-density parity-check codes: asymtotic behavior and zeta functions. Thesis, Penn State University, U.S.A (2009)"},{"key":"11_CR11","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/BF02126799","volume":"8","author":"A. Lubotzky","year":"1988","unstructured":"Lubotzky, A., Phillips, R., Sarnak, P.: Ramanujan graphs. Combinatorica\u00a08, 261\u2013277 (1988)","journal-title":"Combinatorica"},{"key":"11_CR12","unstructured":"Rosenthal, J., Vontobel, P.O.: Constructions of LDPC codes using Ramanujan graphs and ideas from Margulis. In: Proceedings of the 38th Allerton Conference on Communication, Control, and Computing, pp. 248\u2013257 (2000)"},{"key":"11_CR13","doi-asserted-by":"publisher","first-page":"3735","DOI":"10.1109\/TIT.2006.878231","volume":"52","author":"P. Sin","year":"2006","unstructured":"Sin, P., Xiang, Q.: On the dimensions of certain LDPC codes based on q-regular bipartite graphs. IEEE Trans. Inform. Theory\u00a052, 3735\u20133737 (2006)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"11_CR14","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1006\/aima.1996.0050","volume":"121","author":"H.M. Stark","year":"1996","unstructured":"Stark, H.M., Terras, A.A.: Zeta functions of finite graphs and coverings. Adv. in Math.\u00a0121, 124\u2013165 (1996)","journal-title":"Adv. in Math."},{"key":"11_CR15","unstructured":"Wang, C.: Analysis of finite-length low-density parity-check codes. Thesis, Penn State University, U.S.A (in preparation)"},{"key":"11_CR16","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1002\/ett.4460060507","volume":"6","author":"N. Wiberg","year":"1995","unstructured":"Wiberg, N., Loeliger, H.-A., Kotter, R.: Codes and iterative decoding on general graphs. Europ. Trans. on Telecomm.\u00a06, 513\u2013525 (1995)","journal-title":"Europ. Trans. on Telecomm."},{"key":"11_CR17","unstructured":"Wiberg, N.: Codes and Decoding on General Graphs. Thesis, Link\u00f6ping University, Link\u00f6ping, Sweden (1996), \n                  \n                    http:\/\/www.it.isy.liu.se\/publikationer\/LIU-TEK-THESIS-440.pdf"},{"key":"11_CR18","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-8431-1","volume-title":"Lectures on Polytopes","author":"G.M. Ziegler","year":"1995","unstructured":"Ziegler, G.M.: Lectures on Polytopes. Springer, New York (1995)"}],"container-title":["Lecture Notes in Computer Science","Coding and Cryptology"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-01877-0_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,8]],"date-time":"2019-03-08T18:18:24Z","timestamp":1552069104000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-01877-0_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642018138","9783642018770"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-01877-0_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}