{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T16:15:37Z","timestamp":1772122537380,"version":"3.50.1"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2012,1,26]],"date-time":"2012-01-26T00:00:00Z","timestamp":1327536000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2012,12]]},"DOI":"10.1007\/s10623-011-9598-6","type":"journal-article","created":{"date-parts":[[2012,1,25]],"date-time":"2012-01-25T14:59:59Z","timestamp":1327503599000},"page":"259-273","source":"Crossref","is-referenced-by-count":12,"title":["Eigenvalues and expansion of bipartite graphs"],"prefix":"10.1007","volume":"65","author":[{"given":"Tom","family":"H\u00f8holdt","sequence":"first","affiliation":[]},{"given":"Heeralal","family":"Janwa","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,1,26]]},"reference":[{"key":"9598_CR1","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/0012-365X(88)90189-6","volume":"72","author":"N. Alon","year":"1988","unstructured":"Alon N., Chung F.R.K.: Explicit construction of linear sized tolerant networks. Discret. Math. 72, 15\u201319 (1988)","journal-title":"Discret. Math."},{"issue":"5","key":"9598_CR2","doi-asserted-by":"crossref","first-page":"1073","DOI":"10.1016\/j.jcta.2008.12.007","volume":"116","author":"O. Arslan","year":"2009","unstructured":"Arslan O.: The dimension of LU(3,q) codes. J. Comb. Theory A 116(5), 1073\u20131079 (2009)","journal-title":"J. Comb. Theory A"},{"issue":"6","key":"9598_CR3","doi-asserted-by":"crossref","first-page":"1725","DOI":"10.1109\/TIT.2002.1003853","volume":"48","author":"A. Barg","year":"2002","unstructured":"Barg A., Zemor G.: Error exponent of expander codes. IEEE Trans. Inform. Theory 48(6), 1725\u20131729 (2002)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"9598_CR4","unstructured":"Chung F.G.: Spectral Graph Theory. (Revised and Improved Edition). http:\/\/www.math.ucsd.edu-fan ."},{"key":"9598_CR5","unstructured":"Cvetkovic D.M., Doob M., Sachs H.: Spectra of Graphs: Theory and Applications. Academic Press (1979)."},{"key":"9598_CR6","doi-asserted-by":"crossref","unstructured":"Cvetkovic D., Rowlinson P., Simic S.: An introduction to the theory of graph spectra. Cambridge University Press (2010).","DOI":"10.1017\/CBO9780511801518"},{"key":"9598_CR7","unstructured":"Davidoff G., Sarnak P., Valette A.: Elementary Number Teory, Group Theory, and Ramanujan Graphs. London Mathematical Society Student Texts 55 (2003)."},{"issue":"104","key":"9598_CR8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0378-4371(01)00436-8","volume":"302","author":"G.D. Forney","year":"2001","unstructured":"Forney G.D.: Codes on graphs: recent progress. Phys. A 302(104), 1\u201313 (2001)","journal-title":"Phys. A"},{"key":"9598_CR9","unstructured":"Godsil C.D.: Algebraic Combinatorics. Chapman and Hall (1993)."},{"key":"9598_CR10","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1007\/s10711-005-0549-0","volume":"112","author":"P.E. Gunnells","year":"2005","unstructured":"Gunnells P.E.: Some elementary Ramanujan graphs. Geometriae Dedicata 112, 51\u201363 (2005)","journal-title":"Geometriae Dedicata"},{"key":"9598_CR11","unstructured":"Guruswami V., Indyk P.: Expander-based construction of efficiently decodable codes. 42nd IEEE Symposium on Foundation of Computer Science, October 14\u201317, 658 (2001)."},{"key":"9598_CR12","unstructured":"Hall M. Jr.: Combinatorial Theory, 2nd edn. Wiley Interscience in discrete Mathematics."},{"key":"9598_CR13","unstructured":"H\u00f8holdt T., Janwa H.: Optimal bipartite Ramanujan graphs from balanced incomplete block designs: their characterizations and applications to expander\/LDPC codes. In: Bras-Amoros M., H\u00f8holdt T. (eds.) Proceedings of AAECC-18. Springer Lecture Notes in Computer Science, vol. 5527, pp. 53\u201364 (2009)."},{"key":"9598_CR14","unstructured":"Horn Roger A., Johnson, C.R.: Matrix Analysis. Cambridge University Press, (1992)."},{"issue":"4","key":"9598_CR15","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1090\/S0273-0979-06-01126-8","volume":"43","author":"S. Hoory","year":"2006","unstructured":"Hoory S., Linial N., Wigderson A.: Expander graphs and their applications. Bull. Am. Math. Soc. (N.S.), 43(4), 439\u2013561 (2006)","journal-title":"Bull. Am. Math. Soc. (N.S.),"},{"key":"9598_CR16","unstructured":"Janwa H., Lal A.K.: On Expander Graphs: Parameters and Applications. submitted, January 2001. (see arXiv:cs.IT\/04060-48v1)."},{"key":"9598_CR17","doi-asserted-by":"crossref","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: parameters and decoding. Appl. Algebra Eng. Commun. Comput. 13, 335\u2013347 (2003)","journal-title":"Appl. Algebra Eng. Commun. Comput."},{"key":"9598_CR18","unstructured":"Janwa H., Moreno O.: Strongly Ramanujan graphs from codes, polyphase-sequences, and Combinatorics. Proceedings of the International Symposium on Information Theory, 1997 (ISIT-97) Ulm, Germany, pp. 408\u2013408 (1997)."},{"key":"9598_CR19","doi-asserted-by":"crossref","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 50, 2378\u20132388 (2004)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"7","key":"9598_CR20","doi-asserted-by":"crossref","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 47(7), 2711\u20132736 (2001)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"9598_CR21","doi-asserted-by":"crossref","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. Discret. Appl. Math. 60, 275\u2013284 (1997)","journal-title":"Discret. Appl. Math."},{"key":"9598_CR22","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0022-314X(92)90120-E","volume":"41","author":"W.W. Li","year":"1992","unstructured":"Li W.W.: Character sums and abelian Ramanujan graphs. J. Number Theory 41, 199\u2013217 (1992)","journal-title":"J. Number Theory"},{"key":"9598_CR23","doi-asserted-by":"crossref","unstructured":"Li W.W., Meemark Y.: Ramanujan graphs on cosets of PGL 2 (F q ). Finite Fields Their Appl. 11(3), pp. 511\u2013543","DOI":"10.1016\/j.ffa.2005.05.005"},{"key":"9598_CR24","unstructured":"MacWilliams F.J., Sloane N.J.A.: The theory of error-correcting codes. North Holland (1998)."},{"key":"9598_CR25","unstructured":"Niho Y.: Multi-valued cross-correlation functions between two maximal linear recursive sequences. Ph.D. dissetrtation, Unvi. Southern California, Los Angeles, CA (1972)."},{"key":"9598_CR26","doi-asserted-by":"crossref","unstructured":"Payne S.E., Thas J.A.: Finite Generalized Quadrangles, 2nd edn. European Mathematical Society, April 15 (2009).","DOI":"10.4171\/066"},{"key":"9598_CR27","unstructured":"Rosenthal J., Vontobel P.O.: Construction of LDPC codes using ramanujan graphs and ideas from margulis. Allerton Conference (2000)."},{"issue":"7","key":"9598_CR28","first-page":"762","volume":"51","author":"P. Sarnak","year":"2004","unstructured":"Sarnak P.: What is. an Expander. Notices AMS 51(7), 762\u2013763 (2004)","journal-title":"Notices AMS"},{"key":"9598_CR29","doi-asserted-by":"crossref","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 52, 3735\u20133737 (2006)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"9598_CR30","unstructured":"Sipser M., Spielman D.A.: Expander codes. Codes and complexity. IEEE Trans. Inform. Theory 42(6), part 1, 1710\u20131722 (1996)."},{"issue":"6","key":"9598_CR31","doi-asserted-by":"crossref","first-page":"1710","DOI":"10.1109\/18.556667","volume":"42","author":"D.A. Spielman","year":"1996","unstructured":"Spielman D.A.: Linear-time encodable and decodable error-correcting codes. IEEE Trans. Inform. Theory 42(6), 1710\u20131722 (1996)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"9598_CR32","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1137\/0605030","volume":"5","author":"R.M. Tanner","year":"1984","unstructured":"Tanner R.M.: Explicit concentrators from generalized N-gons. SIAM J. Discret. Appl. Math. 5, 287\u2013329 (1984)","journal-title":"SIAM J. Discret. Appl. Math."},{"key":"9598_CR33","unstructured":"Terras A.: Home page of Audrey Terras. http:\/\/math.ucsd.edu\/~aterras ."},{"issue":"2","key":"9598_CR34","doi-asserted-by":"crossref","first-page":"808","DOI":"10.1109\/18.910591","volume":"47","author":"R.M. Tanner","year":"2001","unstructured":"Tanner R.M.: Minimum-distance bounds by graph analysis. IEEE Trans. Inform. Theory 47(2), 808\u2013821 (2001)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"3","key":"9598_CR35","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1007\/s10623-009-9324-9","volume":"54","author":"P. Vanderndriessche","year":"2010","unstructured":"Vanderndriessche P.: Some low-density parity-check codes derived from finite geometries. Des. Codes Cryptogr. 54(3), 287\u2013297 (2010)","journal-title":"Des. Codes Cryptogr."},{"key":"9598_CR36","unstructured":"Wang C.: Analysis of finite-length low-density parity-check codes. Thesis, Pen State University, USA (2010)."},{"issue":"2","key":"9598_CR37","doi-asserted-by":"crossref","first-page":"835","DOI":"10.1109\/18.910593","volume":"IT-47","author":"G. Zemor","year":"2001","unstructured":"Zemor G.: On expander codes. IEEE Trans. Inform. Theory IT-47(2), 835\u2013837 (2001)","journal-title":"IEEE Trans. Inform. Theory"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-011-9598-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-011-9598-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-011-9598-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,22]],"date-time":"2019-06-22T22:46:52Z","timestamp":1561243612000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-011-9598-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,1,26]]},"references-count":37,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2012,12]]}},"alternative-id":["9598"],"URL":"https:\/\/doi.org\/10.1007\/s10623-011-9598-6","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,1,26]]}}}