{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,11,17]],"date-time":"2022-11-17T17:15:50Z","timestamp":1668705350650},"publisher-location":"Berlin, Heidelberg","reference-count":58,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642021800","type":"print"},{"value":"9783642021817","type":"electronic"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-02181-7_6","type":"book-chapter","created":{"date-parts":[[2009,6,6]],"date-time":"2009-06-06T01:43:20Z","timestamp":1244252600000},"page":"53-64","source":"Crossref","is-referenced-by-count":1,"title":["Optimal Bipartite Ramanujan Graphs from Balanced Incomplete Block Designs: Their Characterizations and Applications to Expander\/LDPC Codes"],"prefix":"10.1007","author":[{"given":"Tom","family":"H\u00f8holdt","sequence":"first","affiliation":[]},{"given":"Heeralal","family":"Janwal","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"6_CR1","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/BF02579166","volume":"6","author":"N. Alon","year":"1986","unstructured":"Alon, N.: Eigenvalues and expanders. Combinatorica\u00a06, 83\u201396 (1986)","journal-title":"Combinatorica"},{"issue":"2","key":"6_CR2","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1109\/18.119713","volume":"38","author":"N. Alon","year":"1992","unstructured":"Alon, N., Bruck, J., Naor, J., Naor, M., Roth, R.M.: Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs. IEEE Trans. on Inform. Theory\u00a038(2), 509\u2013516 (1992)","journal-title":"IEEE Trans. on Inform. Theory"},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"Alon, N., Lubotzky, A., Wigderson, A.: Semi-direct product in groups and zig-zag product in graphs: Connections and applications. In: Proc. of the 42nd FOCS, pp. 630\u2013637 (2001)","DOI":"10.1109\/SFCS.2001.959939"},{"issue":"6","key":"6_CR4","doi-asserted-by":"publisher","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\u00a048(6), 1725\u20131729 (2002)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"6","key":"6_CR5","doi-asserted-by":"publisher","first-page":"717","DOI":"10.1142\/S0129167X92000357","volume":"3","author":"H. Bass","year":"1992","unstructured":"Bass, H.: The Ihara-Selberg zeta function of a tree lattice. International Journal of Mathematics\u00a03(6), 717\u2013797 (1992)","journal-title":"International Journal of Mathematics"},{"key":"6_CR6","volume-title":"Algebraic Graph Theory","author":"N. Biggs","year":"1994","unstructured":"Biggs, N.: Algebraic Graph Theory, 2nd edn. Cambridge University Press, Cambridge (1994)","edition":"2"},{"key":"6_CR7","volume-title":"Spectra of Graphs: Theory and Applications","author":"D.M. Cvetkovic","year":"1979","unstructured":"Cvetkovic, D.M., Doob, M., Sachs, H.: Spectra of Graphs: Theory and Applications. Academic Press, London (1979)"},{"issue":"104","key":"6_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0378-4371(01)00436-8","volume":"302","author":"G. David Forney","year":"2001","unstructured":"David Forney, G.: Codes on graphs: recent progress. Phys. A\u00a0302(104), 1\u201313 (2001)","journal-title":"Phys. A"},{"key":"6_CR9","doi-asserted-by":"crossref","unstructured":"Frey, B.J., Koetter, R., Forney, G.D., Kschischang, F.R., McEliece, R.J., Spielman, D.A. (eds.): Special Issue on Codes on Graphs and Iterative Algorithms. IEEE Trans. Inform. Theory\u00a047 (2001)","DOI":"10.1109\/TIT.2001.910571"},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"Friedman, J. (ed.): Expanding Graphs. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol.\u00a010. AMS (1993)","DOI":"10.1090\/dimacs\/010"},{"key":"6_CR11","volume-title":"Algebraic Combinatorics","author":"C.D. Godsil","year":"1993","unstructured":"Godsil, C.D.: Algebraic Combinatorics. Chapman and Hall, Boca Raton (1993)"},{"key":"6_CR12","unstructured":"Guo, Q., Janwa, H.: Some properties of the zig-zag product of graphs. In: Presented at the 2nd NASA-EPSCoR meeting, November 10 (2003) (preprint)"},{"key":"6_CR13","doi-asserted-by":"crossref","unstructured":"Guruswami, V., Indyk, P.: Expander-Based Construction of Efficiently Decodable Codes. In: 42nd IEEE Symposium on Foundation of Computer Science, October 14-17, p. 658 (2001)","DOI":"10.1109\/SFCS.2001.959942"},{"key":"6_CR14","series-title":"Wiley Interscience in discrete Mathematics","volume-title":"Combinatorial Theory","author":"M. Hall Jr.","year":"2003","unstructured":"Hall Jr., M.: Combinatorial Theory, 2nd edn. Wiley Interscience in discrete Mathematics. Kluwer, Dordrecht (2003); H\u00f8holdt, T., Justesen, J.: Graph codes with Reed-Solomon component codes (submitted)","edition":"2"},{"key":"6_CR15","doi-asserted-by":"crossref","unstructured":"H\u00f8holdt, T., Justesen, J.: Graph codes with Reed-Solomon component codes. In: Proc. ISIT 2006, pp. 2002\u20132006 (2006)","DOI":"10.1109\/ISIT.2006.261904"},{"key":"6_CR16","doi-asserted-by":"crossref","unstructured":"H\u00f8holdt, T., Justesen, J.: Iterated analysis of iterated hard decision decoding of product codes with Reed-Solom component codes. In: Proc. ITW 2007 (September 2007)","DOI":"10.1109\/ITW.2007.4313069"},{"key":"6_CR17","unstructured":"H\u00f8holdt, T., Janwa, H.: Characterization of some optimal expander graphs and their application to expander\/LDPC codes (in preparation)"},{"key":"6_CR18","volume-title":"Matrix Analysis","author":"R.A. Horn","year":"1992","unstructured":"Horn, R.A., Johnson, C.R.: Matrix Analysis. Cambridge University Press, Cambridge (1992)"},{"key":"6_CR19","unstructured":"Janwa Jr., H.: \u2018\u2018Relations among Expander Graphs, Codes, Sequence Design, and Their Applications. In: Proceedings of the 4th World Multi-conference on Systemics, Cybernetics and Informatics (SCI 2000 and ISAS 2000), Orlando Florida, July 23-26, vol.\u00a0XI, pp. 122\u2013124 (2000)"},{"issue":"1","key":"6_CR20","first-page":"197","volume":"26","author":"H. Janwa","year":"2005","unstructured":"Janwa, H.: New (Explicit) Constructions of Asymptotic Families of Constant Degree Expander Graphs from Algebraic Geometric (AG) Codes and Their Applications to Tanner Codes. ABSTRACTS OF THE AMS\u00a026(1), 197 (2005); Joint AMS annual Meeting, Atlanta, 2005; Special session on Algebraic Geometry and Codes","journal-title":"ABSTRACTS OF THE AMS"},{"key":"6_CR21","unstructured":"Janwa, H.: New Constructions of Sparse Quasi-Random Graphs (in preparation)"},{"key":"6_CR22","unstructured":"Janwa, H.: Further examples of Ramanujan graphs from AG codes (2003) (in preparation)"},{"key":"6_CR23","unstructured":"Janwa, H.: Covering radius of codes, expander graphs, and Waring\u2019s problem over finite fields (in preparation)"},{"key":"6_CR24","unstructured":"Janwa, H.: A graph theoretic proof of the Delsarte bound on the covering radius of linear codes (preprint)"},{"key":"6_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/3-540-44828-4_14","volume-title":"Applied Algebra, Algebraic Algorithms and Error-Correcting Codes","author":"H. Janwa","year":"2003","unstructured":"Janwa, H.: Good Expander Graphs and Expander Codes: Parameters and Decoding. In: Fossorier, M.P.C., H\u00f8holdt, T., Poli, A. (eds.) AAECC 2003. LNCS, vol.\u00a02643, pp. 119\u2013128. Springer, Heidelberg (2003)"},{"key":"6_CR26","unstructured":"Janwa, H., Lal, A.K.: \u2018\u2018On Expander Graphs: Parameters and Applications (January 2001) (submitted), arXiv:cs.IT\/04060-48v1"},{"key":"6_CR27","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: Parameters and Decoding. Applicable Algebra in Engineering, Communication and Computing\u00a013, 335\u2013347 (2003)","journal-title":"Applicable Algebra in Engineering, Communication and Computing"},{"key":"6_CR28","first-page":"193","volume":"179","author":"H. Janwa","year":"2006","unstructured":"Janwa, H.: Explicit Constructions of Asymptotic Families of Constant Degree Expander Graphs from Algebraic Geometric (AG) Codes. Congressus Numerantium\u00a0179, 193\u2013207 (2006)","journal-title":"Congressus Numerantium"},{"key":"6_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1007\/978-3-540-77224-8_40","volume-title":"On the Generalized Hamming Weights and the Covering Radius of Linear Codes","author":"H. Janwa","year":"2007","unstructured":"Janwa, H., Lal, A.K.: On the Generalized Hamming Weights and the Covering Radius of Linear Codes. LNCS, vol.\u00a04871, pp. 347\u2013356. Springer, Heidelberg (2007)"},{"key":"6_CR30","doi-asserted-by":"crossref","unstructured":"Janwa, H., Mattson Jr., H.F.: \u2018\u2018The Projective Hypercube and Its Properties and Applications. In: Proceedings of the 2001 International Symposium on Information Theory (ISIT 2001), Washington D.C., USA (June 2001)","DOI":"10.1109\/ISIT.2001.936175"},{"key":"6_CR31","doi-asserted-by":"crossref","unstructured":"Janwa, H., Moreno, O.: Strongly Ramanujan graphs from codes, polyphase-sequences, and Combinatorics. In: Proceedings of the International Symposium on Information Theory (ISIT 1997), Ulm, Germany, p. 408 (1997)","DOI":"10.1109\/ISIT.1997.613345"},{"key":"6_CR32","unstructured":"Janwa, H., Moreno, O.: New Constructions of Ramanujan Graphs and Good Expander Graphs from Codes, Exponential Sums and Sequences. IMA Summer Program on Codes, Systems and Graphical Models (August 1999)"},{"key":"6_CR33","unstructured":"Janwa, H., Moreno, O.: Elementary constructions of some Ramanujan graphs. Congressus Numerantium (December 1995)"},{"key":"6_CR34","first-page":"63","volume":"130","author":"H. Janwa","year":"1998","unstructured":"Janwa, H., Moreno, O.: \u2018\u2018Coding theoretic constructions of some number theoretic Ramanujan graphs. Congressus Numerantium\u00a0130, 63\u201376 (1998)","journal-title":"Congressus Numerantium"},{"key":"6_CR35","unstructured":"Janwa, H., Moreno, O.: \u2018\u2018Expander Graphs, Ramanujan Graphs, Codes, Exponential Sums, and Sequences (to be submitted)"},{"key":"6_CR36","unstructured":"Janwa, H., Moreno, O., Kumar, P.V., Helleseth, T.: Ramanujan graphs from codes over Galois Rings (in preparation)"},{"key":"6_CR37","unstructured":"Janwa, H., Rangachari, S.S.: Ramanujan Graphs. Lecture Notes. Preliminary Version (July 1994)"},{"issue":"7","key":"6_CR38","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"},{"key":"6_CR39","unstructured":"Lin, S., Kou, Y.: A Geometric Approach to the Construction of Low Density Parity Check Codes. In: Presented at the IEEE 29th Communication Theory Workshop, Haynes City, Fla., May 7-10 (2001)"},{"key":"6_CR40","volume-title":"Proceedings of the ForneyFest","author":"S. Lin","year":"2000","unstructured":"Lin, S., Kou, Y., Fossorier, M.: Finite Geometry Low Density Parity Check Codes: Construction, Structure and Decoding. In: Proceedings of the ForneyFest. Kluwer Academic, Boston (2000)"},{"key":"6_CR41","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/0022-314X(92)90120-E","volume":"41","author":"W.-C.W. Li","year":"1992","unstructured":"Li, W.-C.W.: Character sums and abelian Ramanujan graphs. Journal of Number Theory\u00a041, 199\u2013217 (1992)","journal-title":"Journal of Number Theory"},{"key":"6_CR42","doi-asserted-by":"publisher","volume-title":"Discrete Groups, Expanding Graphs and Invariant Measures","author":"A. Lubotzky","year":"1994","unstructured":"Lubotzky, A.: Discrete Groups, Expanding Graphs and Invariant Measures. Birkh\u00e4user, Basel (1994)","DOI":"10.1007\/978-3-0346-0332-4"},{"key":"6_CR43","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/BF02126799","volume":"8","author":"A. Lubotzky","year":"1988","unstructured":"Lubotzky, A., Phillips, R., Sarnak, P.: Ramanujan Graphs. Combinatorica\u00a08, 261\u2013277 (1988)","journal-title":"Combinatorica"},{"key":"6_CR44","unstructured":"Margulis, G.A.: Explicit group theoretic constructions of combinatorial schemes and their applications for construction of expanders and super-concentrators. Journal of Problems of Information Transformation, 39\u201346 (1988)"},{"key":"6_CR45","doi-asserted-by":"crossref","unstructured":"Reingold, O., Vadhan, S., Wigderson, A.: Entropy waves, the zig-zag graph product, and new constant-degree expanders. Ann. of Math.\u00a0155(1), 157\u2013187 (2002)","DOI":"10.2307\/3062153"},{"issue":"2","key":"6_CR46","doi-asserted-by":"publisher","first-page":"569","DOI":"10.1109\/18.910575","volume":"47","author":"T. Richardson","year":"2001","unstructured":"Richardson, T., Urbanke, R.: The capacity of low-density parity check codes under message-passing decoding. IEEE Trans. Inform. Theory\u00a047(2), 569\u2013618 (2001)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"2","key":"6_CR47","doi-asserted-by":"publisher","first-page":"619","DOI":"10.1109\/18.910578","volume":"47","author":"T.J. Richardson","year":"2001","unstructured":"Richardson, T.J., Shokrollahi, M.A., Urbanke, R.: Design of capacity-approaching irregular low-density parity-check codes. IEEE Trans. Inform. Theory\u00a047(2), 619\u2013637 (2001)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"6_CR48","unstructured":"Rosenthal, J., Vontobel, P.O.: Construction of LDPC Codes using Ramanujan Graphs and Ideas from Margulis. In: Allerton Conference (2000)"},{"issue":"8","key":"6_CR49","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 codes. IEEE Trans. on Inform. Theory\u00a052(8), 3650\u20133661 (2006)","journal-title":"IEEE Trans. on Inform. Theory"},{"key":"6_CR50","doi-asserted-by":"publisher","volume-title":"Some Applications of Modular Forms","author":"P. Sarnak","year":"1990","unstructured":"Sarnak, P.: Some Applications of Modular Forms. Cambridge University Press, Cambridge (1990)","DOI":"10.1017\/CBO9780511895593"},{"issue":"7","key":"6_CR51","first-page":"762","volume":"51","author":"P. Sarnak","year":"2004","unstructured":"Sarnak, P.: What is... an Expander. Notices of the AMS\u00a051(7), 762\u2013763 (2004)","journal-title":"Notices of the AMS"},{"key":"6_CR52","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-46541-3_1","volume-title":"STACS 2000","author":"A. Shokrollahi","year":"2000","unstructured":"Shokrollahi, A.: Codes and graphs. In: Reichel, H., Tison, S. (eds.) STACS 2000. LNCS, vol.\u00a01770, pp. 1\u201312. Springer, Heidelberg (2000)"},{"issue":"6","key":"6_CR53","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. Codes and complexity. IEEE Trans. Inform. Theory\u00a042(6, part 1), 1710\u20131722 (1996)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"6","key":"6_CR54","doi-asserted-by":"publisher","first-page":"1710","DOI":"10.1109\/18.556668","volume":"42","author":"D.A. Spielman","year":"1996","unstructured":"Spielman, D.A.: Linear-time encodable and decodable error-correcting codes. IEEE Trans. on Inform. Theory\u00a042(6), 1710\u20131722 (1996)","journal-title":"IEEE Trans. on Inform. Theory"},{"key":"6_CR55","doi-asserted-by":"publisher","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. of Discrete and Applied Mathematics\u00a05, 287\u2013289 (1984)","journal-title":"SIAM J. of Discrete and Applied Mathematics"},{"key":"6_CR56","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511987045","volume-title":"A Course in Combinatorics","author":"J.H. Lint van","year":"2001","unstructured":"van Lint, J.H., Wilson, R.M.: A Course in Combinatorics, 2nd edn. Cambridge University Press, Cambridge (2001)","edition":"2"},{"issue":"2","key":"6_CR57","doi-asserted-by":"publisher","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\u00a047(2), 808\u2013821 (2001)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"2","key":"6_CR58","doi-asserted-by":"publisher","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.\u00a0IT-47(2), 835\u2013837 (2001)","journal-title":"IEEE Trans. Inform. Theory."}],"container-title":["Applied Algebra, Algebraic Algorithms and Error-Correcting Codes","Lecture Notes in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02181-7_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T18:30:14Z","timestamp":1558377014000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02181-7_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642021800","9783642021817"],"references-count":58,"URL":"http:\/\/dx.doi.org\/10.1007\/978-3-642-02181-7_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"published":{"date-parts":[[2009]]}}}