{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:26:40Z","timestamp":1725517600259},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540874478"},{"type":"electronic","value":"9783540874485"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-87448-5_10","type":"book-chapter","created":{"date-parts":[[2008,8,25]],"date-time":"2008-08-25T12:12:04Z","timestamp":1219666324000},"page":"82-94","source":"Crossref","is-referenced-by-count":1,"title":["Adaptive Soft-Decision Iterative Decoding Using Edge Local Complementation"],"prefix":"10.1007","author":[{"given":"Joakim Grahl","family":"Knudsen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Constanza","family":"Riera","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthew G.","family":"Parker","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eirik","family":"Rosnes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"10_CR1","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(1), 21\u201328 (1962)","journal-title":"IRE Trans. Inform. Theory"},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"MacKay, D.J.C., Neal, R.M.: Good codes based on very sparse matrices. In: Cryptography and Coding 5th IMA Conf., December 1995, pp. 100\u2013111 (1995)","DOI":"10.1007\/3-540-60693-9_13"},{"issue":"8","key":"10_CR3","doi-asserted-by":"publisher","first-page":"3746","DOI":"10.1109\/TIT.2006.878176","volume":"52","author":"J. Jiang","year":"2006","unstructured":"Jiang, J., Narayanan, K.R.: Iterative soft-input soft-output decoding of Reed-Solomon codes by adapting the parity-check matrix. IEEE Trans. Inform. Theory\u00a052(8), 3746\u20133756 (2006)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"4","key":"10_CR4","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1109\/LCOMM.2004.827977","volume":"8","author":"J. Jiang","year":"2004","unstructured":"Jiang, J., Narayanan, K.R.: Iterative soft decision decoding of Reed-Solomon codes. IEEE Commun. Lett.\u00a08(4), 244\u2013246 (2004)","journal-title":"IEEE Commun. Lett."},{"issue":"4","key":"10_CR5","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1109\/TCOMM.2008.060105","volume":"56","author":"T.R. Halford","year":"2008","unstructured":"Halford, T.R., Chugg, K.M.: Random redundant iterative soft-in soft-out decoding. IEEE Trans. on Commun.\u00a056(4), 513\u2013517 (2008)","journal-title":"IEEE Trans. on Commun."},{"key":"10_CR6","unstructured":"Vontobel, P.O., Koetter, R.: Graph-cover decoding and finite-length analysis of message-passing iterative decoding of LDPC codes. IEEE Trans.Inform.Theory (2005) (submitted for publication)"},{"issue":"6","key":"10_CR7","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. Inform. Theory\u00a048(6), 1570\u20131579 (2002)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10_CR8","unstructured":"Richardson, T.: Error floors of LDPC codes. In: Proc.41st Annual Allerton Conf.on Commun., Control, and Computing, Monticello, IL, October 2003, pp. 1426\u20131435 (2003)"},{"issue":"2","key":"10_CR9","doi-asserted-by":"publisher","first-page":"599","DOI":"10.1109\/18.910577","volume":"47","author":"T.J. Richardson","year":"2001","unstructured":"Richardson, T.J., Urbanke, R.: The capacity of low-density parity-check codes under message-passing decoding. IEEE Trans. Inform. Theory\u00a047(2), 599\u2013618 (2001)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10_CR10","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/S0195-6698(87)80027-6","volume":"8","author":"A. Bouchet","year":"1987","unstructured":"Bouchet, A.: Isotropic systems. European Journal of Combinatorics\u00a08, 231\u2013244 (1987)","journal-title":"European Journal of Combinatorics"},{"key":"10_CR11","doi-asserted-by":"crossref","unstructured":"Danielsen, L.E., Parker, M.G.: Edge local complementation and equivalence of binary linear codes. Des. Codes Cryptogr. (to appear, 2008)","DOI":"10.1007\/s10623-008-9190-x"},{"key":"10_CR12","unstructured":"Riera, C., Parker, M.G.: On Pivot orbits of Boolean functions, optimal codes and related topics. In: Fourth International Workshop on Optimal Codes and Related Topics, Sofia, Institute of Mathematics and Informatics, Bulgarian Academy of Sciences, June 2005, pp. 248\u2013253 (2005)"},{"issue":"2","key":"10_CR13","doi-asserted-by":"publisher","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 the sum-product algorithm. IEEE. Trans. on Inform. Theory\u00a047(2), 498\u2013519 (2001)","journal-title":"IEEE. Trans. on Inform. Theory"},{"key":"10_CR14","unstructured":"Knudsen, J.G.: Randomised construction and dynamic decoding of LDPC codes. Master\u2019s thesis, University of Bergen (2006)"},{"issue":"7","key":"10_CR15","doi-asserted-by":"publisher","first-page":"1351","DOI":"10.1016\/j.jcta.2005.12.004","volume":"113","author":"L.E. Danielsen","year":"2006","unstructured":"Danielsen, L.E., Parker, M.G.: On the classification of all self-dual additive codes over GF(4) of length up to 12. Journ. of Comb. Theory, Series A\u00a0113(7), 1351\u20131367 (2006)","journal-title":"Journ. of Comb. Theory, Series A"},{"key":"10_CR16","unstructured":"Catherine, C.: Enhancing the error-correction performance of low-density parity-check codes. PhD thesis, University of Mauritius (2008)"},{"key":"10_CR17","doi-asserted-by":"crossref","unstructured":"Kothiyal, A., Takeshita, O.: A comparison of adaptive belief propagation and the best graph algorithm for the decoding of linear block codes. In: International Symposium on Information Theory, September 2005, pp. 724\u2013728 (2005)","DOI":"10.1109\/ISIT.2005.1523431"},{"issue":"7","key":"10_CR18","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.P.C.: Low-density parity-check codes based on finite geometries: A rediscovery and new results. IEEE Trans. Inform. Theory\u00a047(7), 2711\u20132736 (2001)","journal-title":"IEEE Trans. Inform. Theory"}],"container-title":["Lecture Notes in Computer Science","Coding Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-87448-5_10.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:58:43Z","timestamp":1619524723000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-87448-5_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540874478","9783540874485"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-87448-5_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}