{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:26:43Z","timestamp":1725517603839},"publisher-location":"Berlin, Heidelberg","reference-count":17,"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_9","type":"book-chapter","created":{"date-parts":[[2008,8,25]],"date-time":"2008-08-25T12:12:04Z","timestamp":1219666324000},"page":"80-81","source":"Crossref","is-referenced-by-count":0,"title":["Codes from Expander Graphs"],"prefix":"10.1007","author":[{"given":"Tom","family":"H\u00f8holdt","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","first-page":"835","volume":"47","author":"G. Z\u00e8mor","year":"2001","unstructured":"Z\u00e8mor, G.: On expander codes. IEEE Trans. Inform. Theory (Special Issue on Codes on Graphs and iterative Algorithms)\u00a047, 835\u2013837 (2001)","journal-title":"IEEE Trans. Inform. Theory (Special Issue on Codes on Graphs and iterative Algorithms)"},{"key":"9_CR2","doi-asserted-by":"publisher","first-page":"1725","DOI":"10.1109\/TIT.2002.1003853","volume":"48","author":"A. Barg","year":"2002","unstructured":"Barg, A., Z\u00e8mor, G.: Error exponents of expander codes. IEEE Trans. Inform. Theory\u00a048, 1725\u20131729 (2002)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"9_CR3","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1109\/TIT.1981.1056404","volume":"27","author":"M. Tanner","year":"1981","unstructured":"Tanner, M.: A Recursive Approach to Low Complexity Codes. IEEE Trans. Inform. Theory\u00a027, 533\u2013547 (1981)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"3","key":"9_CR4","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1137\/0605030","volume":"5","author":"M. Tanner","year":"1984","unstructured":"Tanner, M.: Explicit Concentrators from Generalized N\u2013Gons. SIAM J. Alg. Disc. Meth.\u00a05(3), 287\u2013293 (1984)","journal-title":"SIAM J. Alg. Disc. Meth."},{"key":"9_CR5","doi-asserted-by":"publisher","first-page":"808","DOI":"10.1109\/18.910591","volume":"47","author":"M. Tanner","year":"2001","unstructured":"Tanner, M.: Minimum-Distance Bounds by Graph Analysis. IEEE Trans. Inform. Theory\u00a047, 808\u2013821 (2001)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"6","key":"9_CR6","doi-asserted-by":"publisher","first-page":"1710","DOI":"10.1109\/18.556667","volume":"42","author":"M. Sipser","year":"1996","unstructured":"Sipser, M., Spielman, D.A.: Expander Codes. IEEE Trans. Inform. Theory\u00a042(6), 1710\u20131722 (1996)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"9_CR7","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511808968","volume-title":"Introduction to Coding Theory","author":"R.M. Roth","year":"2006","unstructured":"Roth, R.M.: Introduction to Coding Theory. Cambridge University Press, Cambridge (2006)"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"Janwa, H., Lal, A.K.: On Tanner Codes: Minimum Distance and Decoding. In: AAECC, vol.\u00a013, pp. 335\u2013347 (2003)","DOI":"10.1007\/s00200-003-0098-4"},{"issue":"8","key":"9_CR9","doi-asserted-by":"publisher","first-page":"3650","DOI":"10.1109\/TIT.2006.878232","volume":"52","author":"R.M. Roth","year":"2006","unstructured":"Roth, R.M., Skachek, V.: Improved Nearly-MDS Expander Codes. IEEE Trans. Inform. Theory\u00a052(8), 3650\u20133661 (2006)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"9_CR10","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1016\/0021-8693(64)90028-6","volume":"1","author":"W. Feit","year":"1964","unstructured":"Feit, W., Higman, G.: The nonexistence of certain generalized polygons. J.\u00a0Algebra\u00a01, 114\u2013131 (1964)","journal-title":"J.\u00a0Algebra"},{"key":"9_CR11","volume-title":"Generalized Polygons","author":"H. Maldeghem van","year":"1998","unstructured":"van Maldeghem, H.: Generalized Polygons. Birkh\u00e4user, Basel (1998)"},{"key":"9_CR12","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1109\/TIT.1986.1057212","volume":"32","author":"R. McEliece","year":"1986","unstructured":"McEliece, R., Swanson, L.: On the error probability for Reed-Solomon codes. IEEE Trans. Inform. Theory\u00a032, 701\u2013703 (1986)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"9_CR13","first-page":"11","volume":"67","author":"B. Pittel","year":"1996","unstructured":"Pittel, B., Spencer, J., Wormald, N.: Sudden emergence of a giant k-core in a random graph. J.\u00a0Comb.\u00a0Theory, Series B\u00a067, 11\u2013151 (1996)","journal-title":"J.\u00a0Comb.\u00a0Theory, Series B"},{"issue":"1-2","key":"9_CR14","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1002\/rsa.20147","volume":"30","author":"S. Janson","year":"2007","unstructured":"Janson, S., Luczak, M.J.: A simple solution to the k-core problem. Random Structures Algorithms\u00a030(1-2), 50\u201362 (2007)","journal-title":"Random Structures Algorithms"},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"H\u00f8holdt, T., Justesen, J.: Graph codes with Reed-Solomon component codes. In: Proceedings ISIT 2006, Seattle, Washington, July 2006, pp. 2022\u20132026 (2006)","DOI":"10.1109\/ISIT.2006.261904"},{"key":"9_CR16","doi-asserted-by":"crossref","unstructured":"H\u00f8holdt, T., Justesen, J.: Iterative decoding of product codes and graph codes with Reed-Solomon component codes. In: Proceedings ITW 2007 (September 2007)","DOI":"10.1109\/ITW.2007.4313069"},{"key":"9_CR17","unstructured":"H\u00f8holdt, T., Justesen, J.: Graph Codes with Reed-Solomon Component Codes. In: IEEE Trans. Inform. Theory (March 2008) (submitted)"}],"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_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:37:51Z","timestamp":1606185471000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-87448-5_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540874478","9783540874485"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-87448-5_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}