{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T01:05:20Z","timestamp":1725584720816},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642209000"},{"type":"electronic","value":"9783642209017"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-20901-7_12","type":"book-chapter","created":{"date-parts":[[2011,6,4]],"date-time":"2011-06-04T10:11:30Z","timestamp":1307182290000},"page":"201-212","source":"Crossref","is-referenced-by-count":2,"title":["The Minimum Distance of Graph Codes"],"prefix":"10.1007","author":[{"given":"Tom","family":"H\u00f8holdt","sequence":"first","affiliation":[]},{"given":"J\u00f8rn","family":"Justesen","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"12_CR1","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"},{"key":"12_CR2","doi-asserted-by":"publisher","first-page":"835","DOI":"10.1109\/18.910593","volume":"47","author":"G. Z\u00e9mor","year":"2001","unstructured":"Z\u00e9mor, 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"},{"key":"12_CR3","doi-asserted-by":"publisher","first-page":"1725","DOI":"10.1109\/TIT.2002.1003853","volume":"48","author":"A. Barg","year":"2002","unstructured":"Barg, A., Z\u00e9mor, G.: Error exponents of expander codes. IEEE Trans. Inform. Theory\u00a048, 1725\u20131729 (2002)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"3","key":"12_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-Gons. SIAM J. Alg. Disc. Meth.\u00a05(3), 287\u2013293 (1984)","journal-title":"SIAM J. Alg. Disc. Meth."},{"key":"12_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":"12_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":"12_CR7","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511615825","volume-title":"Elementary Number Theory, Group Theory, and Ramanujan Graphs","author":"G. Davidoff","year":"2003","unstructured":"Davidoff, G., Sarnak, P., Valette, A.: Elementary Number Theory, Group Theory, and Ramanujan Graphs, vol.\u00a055. London Mathematical Society, Student Texts (2003)"},{"key":"12_CR8","doi-asserted-by":"publisher","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":"12_CR9","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/s00200-003-0098-4","volume":"13","author":"H. Janwa","year":"2003","unstructured":"Janwa, H., Lal, A.K.: On Tanner Codes: Minimum Distance and Decoding. AAECC\u00a013, 335\u2013347 (2003)","journal-title":"AAECC"},{"issue":"8","key":"12_CR10","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":"12_CR11","unstructured":"Skachek, V.: Low-Density-Parity-Check Codes: Constructions and Bounds, Ph.D. Thesis, Technion, Haifa, Israel (January 2007)"},{"key":"12_CR12","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. Algebra\u00a01, 114\u2013131 (1964)","journal-title":"J. Algebra"},{"key":"12_CR13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-0348-0271-0","volume-title":"Generalized Polygons","author":"H. Maldeghem van","year":"1998","unstructured":"van Maldeghem, H.: Generalized Polygons. Birkh\u00e4user-Verlag, Basel (1998)"},{"key":"12_CR14","volume-title":"The Mathematical Theory of Coding","author":"I.A. Blake","year":"1975","unstructured":"Blake, I.A., Mullin, R.C.: The Mathematical Theory of Coding. Academic Press, New York (1975)"},{"key":"12_CR15","volume-title":"Concrete Abstract Algebra","author":"N. Lauritzen","year":"2005","unstructured":"Lauritzen, N.: Concrete Abstract Algebra. Cambridge University Press, Cambridge (2005)"},{"key":"12_CR16","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511543401","volume-title":"Algebraic Codes on Lines, Planes, and Curves","author":"R.E. Blahut","year":"2008","unstructured":"Blahut, R.E.: Algebraic Codes on Lines, Planes, and Curves. Cambridge University Press, Cambridge (2008)"},{"key":"12_CR17","doi-asserted-by":"crossref","unstructured":"H\u00f8holdt, T., Justesen, J.: Graph codes with Reed-Solomon component codes. In: Proceedings ISIT 2006, Seattle, Washington, pp. 2022\u20132026 (July 2006)","DOI":"10.1109\/ISIT.2006.261904"}],"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-20901-7_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,28]],"date-time":"2019-03-28T03:47:32Z","timestamp":1553744852000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-20901-7_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642209000","9783642209017"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-20901-7_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}