{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:30:35Z","timestamp":1725496235884},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540772231"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-77224-8_3","type":"book-chapter","created":{"date-parts":[[2007,11,29]],"date-time":"2007-11-29T10:38:56Z","timestamp":1196332736000},"page":"18-19","source":"Crossref","is-referenced-by-count":0,"title":["Iterative List Decoding of LDPC Codes"],"prefix":"10.1007","author":[{"given":"Tom","family":"H\u00f8holdt","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J\u00f8rn","family":"Justesen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"3_CR1","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/4347.001.0001","volume-title":"Low-Density Parity-Check Codes","author":"R.G. Gallager","year":"1963","unstructured":"Gallager, R.G.: Low-Density Parity-Check Codes. M.I.T. Press, Cambridge, MA (1963)"},{"key":"3_CR2","unstructured":"Elias, P.: List Decoding for Noisy Channel. Res. Lab. Electron., MIT, Cambridge, MA, Techn. Rep. 335 (1957)"},{"key":"3_CR3","doi-asserted-by":"publisher","first-page":"2711","DOI":"10.1109\/18.959255","volume":"47","author":"Y. Kou","year":"2001","unstructured":"Kou, Y., Lin, S., Fossorier, M.: Low-Density Parity-Check Codes Based on Finite Geometries: A Rediscovery and New Results. IEEE Trans. Inform. Theory\u00a047, 2711\u20132736 (2001)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"3_CR4","doi-asserted-by":"publisher","first-page":"3890","DOI":"10.1109\/TIT.2005.856936","volume":"51","author":"Z. Liu","year":"2005","unstructured":"Liu, Z., Pados, D.A.: LDPC Codes from Generalized Polygons. IEEE Trans. Inform. Theory\u00a051, 3890\u20133898 (2005)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"3_CR5","doi-asserted-by":"publisher","first-page":"709","DOI":"10.1109\/TIT.1986.1057216","volume":"32","author":"M. Bossert","year":"1986","unstructured":"Bossert, M., Hergert, F.: Hard-and Soft-Decision Decoding Beyond the Half Minimum Distance - An Algorithm for Linear Codes. IEEE Trans. Inform. Theory\u00a032, 709\u2013714 (1986)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"3_CR6","unstructured":"Hjaltason, J.: List Decoding of LDPC Codes. M. Eng. Thesis, Department of Mathematics, Technical University of Denmark (2005)"},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"Justesen, J., H\u00f8holdt, T., Hjaltason, J.: Iterative List Decoding of Some LDPC Codes. IEEE Trans. Inform. Theory. (to appear, 2007)","DOI":"10.1109\/TIT.2007.907485"},{"key":"3_CR8","unstructured":"Kristensen, J.T.: List Decoding of LDPC Codes. M. Eng. Thesis, COM, Technical University of Denmark (2007)"}],"container-title":["Lecture Notes in Computer Science","Applied Algebra, Algebraic Algorithms and Error-Correcting Codes"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-77224-8_3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:04:45Z","timestamp":1619521485000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-77224-8_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540772231"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-77224-8_3","relation":{},"subject":[]}}