{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T20:31:20Z","timestamp":1761597080546},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2008,3,1]],"date-time":"2008-03-01T00:00:00Z","timestamp":1204329600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[2008,3]]},"DOI":"10.1007\/s00493-008-2195-2","type":"journal-article","created":{"date-parts":[[2008,4,26]],"date-time":"2008-04-26T11:55:19Z","timestamp":1209210919000},"page":"163-185","source":"Crossref","is-referenced-by-count":12,"title":["Parity check matrices and product representations of squares"],"prefix":"10.1007","volume":"28","author":[{"given":"Assaf","family":"Naor","sequence":"first","affiliation":[]},{"given":"Jacques","family":"Verstra\u00ebte","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,4,27]]},"reference":[{"issue":"4","key":"2195_CR1","doi-asserted-by":"crossref","first-page":"567","DOI":"10.1016\/0196-6774(86)90019-2","volume":"7","author":"N. Alon","year":"1986","unstructured":"N. Alon, L. Babai and A. Itai: A fast and simple randomized parallel algorithm for the maximal independent set problem, J. Algorithms 7(4) (1986), 567\u2013583.","journal-title":"J. Algorithms"},{"issue":"3","key":"2195_CR2","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1002\/rsa.3240030308","volume":"3","author":"N. Alon","year":"1992","unstructured":"N. Alon, O. Goldreich, J. H\u00e5stad and R. Peralta: Simple constructions of almost k-wise independent random variables, Random Structures Algorithms 3(3) (1992), 289\u2013304.","journal-title":"Random Structures Algorithms"},{"issue":"1","key":"2195_CR3","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1007\/s003730200002","volume":"18","author":"N. Alon","year":"2002","unstructured":"N. Alon, S. Hoory and N. Linial: The Moore bound for irregular graphs, Graphs Combin. 18(1) (2002), 53\u201357.","journal-title":"Graphs Combin."},{"key":"2195_CR4","doi-asserted-by":"crossref","DOI":"10.1002\/0471722154","volume-title":"The probabilistic method","author":"N. Alon","year":"2000","unstructured":"N. Alon and J. H. Spencer: The probabilistic method, Wiley-Interscience Series in Discrete Mathematics and Optimization. Wiley-Interscience [John Wiley & Sons], New York, second edition, 2000. With an appendix on the life and work of Paul Erd\u0151s.","edition":"second edition"},{"issue":"4","key":"2195_CR5","doi-asserted-by":"crossref","first-page":"844","DOI":"10.1145\/210332.210337","volume":"42","author":"N. Alon","year":"1995","unstructured":"N. Alon, R. Yuster and U. Zwick: Color-coding, J. Assoc. Comput. Mach. 42(4) (1995), 844\u2013856.","journal-title":"J. Assoc. Comput. Mach."},{"issue":"3","key":"2195_CR6","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1007\/BF02523189","volume":"17","author":"N. Alon","year":"1997","unstructured":"N. Alon, R. Yuster and U. Zwick: Finding and counting given length cycles, Algorithmica 17(3) (1997), 209\u2013223.","journal-title":"Algorithmica"},{"key":"2195_CR7","unstructured":"L. Bazzi, M. Mahdian and D. A. Spielman: The minimum distance of Turbo-like codes, preprint, 2003."},{"key":"2195_CR8","doi-asserted-by":"crossref","unstructured":"C. Berrou, A. Glavieux and P. Thitimajshima: Near Shannon Limit Error Correcting Codes and Decoding: Turbo Codes; in Proceedings of IEEE International Communications Conference, pages 1064\u20131070, 1993.","DOI":"10.1109\/ICC.1993.397441"},{"issue":"5","key":"2195_CR9","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1017\/S0963548399004058","volume":"8","author":"C. Bertram-Kretzberg","year":"1999","unstructured":"C. Bertram-Kretzberg, T. Hofmeister and H. Lefmann: Sparse 0\u20131 matrices and forbidden hypergraphs, Combin. Probab. Comput. 8(5) (1999), 417\u2013427.","journal-title":"Combin. Probab. Comput."},{"issue":"4","key":"2195_CR10","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1002\/1098-2418(200007)16:4<293::AID-RSA1>3.0.CO;2-F","volume":"16","author":"C. Bertram-Kretzberg","year":"2000","unstructured":"C. Bertram-Kretzberg and H. Lefmann: MODp-tests, almost independence and small probability spaces; Random Structures Algorithms 16(4) (2000), 293\u2013313.","journal-title":"Random Structures Algorithms"},{"key":"2195_CR11","volume-title":"Projective geometry: from foundations to applications","author":"A. Beutelspacher","year":"1998","unstructured":"A. Beutelspacher and U. Rosenbaum: Projective geometry: from foundations to applications; Cambridge University Press, Cambridge, 1998."},{"key":"2195_CR12","volume-title":"Extremal graph theory","author":"B. Bollob\u00e1s","year":"2004","unstructured":"B. Bollob\u00e1s: Extremal graph theory, Dover Publications Inc., Mineola, NY, 2004. Reprint of the 1978 original."},{"key":"2195_CR13","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0095-8956(74)90052-5","volume":"16","author":"J. Bondy","year":"1974","unstructured":"J. Bondy and M. Simonovits: Cycles of even length in graphs, J. Combinatorial Theory Ser. B 16 (1974), 97\u2013105.","journal-title":"J. Combinatorial Theory Ser. B"},{"issue":"8","key":"2195_CR14","doi-asserted-by":"crossref","first-page":"1692","DOI":"10.1109\/TIT.2004.831763","volume":"50","author":"M. Breiling","year":"2004","unstructured":"M. Breiling: A logarithmic upper bound on the minimum distance of Turbo codes, IEEE Transactions on Information Theory 50(8) (2004), 1692\u20131710.","journal-title":"IEEE Transactions on Information Theory"},{"key":"2195_CR15","first-page":"693","volume-title":"Handbook of combinatorics","author":"A. E. Brouwer","year":"1995","unstructured":"A. E. Brouwer: Block designs, in: Handbook of combinatorics, Vol. 1, 2, pages 693\u2013745, Elsevier, Amsterdam, 1995."},{"key":"2195_CR16","first-page":"55","volume-title":"New directions in the theory of graphs, Proc 3rd Ann. Arbor Conference on Graph Theory","author":"W. G. Brown","year":"1973","unstructured":"W. G. Brown, P. Erd\u0151s and V. T. S\u00f3s: Some extremal problems on r-graphs, in: New directions in the theory of graphs, Proc 3rd Ann. Arbor Conference on Graph Theory, Academic Press, New York, 55\u201363, 1973."},{"issue":"6","key":"2195_CR17","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1109\/4234.681360","volume":"2","author":"M. C. Davey","year":"1998","unstructured":"M. C. Davey and D. J. C. MacKay: Low-density parity check codes over GF(q), IEEE Communications Letters 2(6) (1998), 165\u2013167.","journal-title":"IEEE Communications Letters"},{"issue":"153","key":"2195_CR18","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1090\/S0025-5718-1981-0595059-1","volume":"36","author":"J. D. Dixon","year":"1981","unstructured":"J. D. Dixon: Asymptotically fast factorization of integers, Math. Comp. 36(153) (1981), 255\u2013260.","journal-title":"Math. Comp."},{"key":"2195_CR19","first-page":"131","volume":"1","author":"P. Erd\u0151s","year":"1969","unstructured":"P. Erd\u0151s: On some applications of graph theory to number theoretic problems, Publ. Ramanujan Inst. 1 (1969), 131\u2013136.","journal-title":"Publ. Ramanujan Inst."},{"issue":"6","key":"2195_CR20","doi-asserted-by":"crossref","first-page":"567","DOI":"10.1016\/0195-6698(95)90039-X","volume":"16","author":"P. Erd\u0151s","year":"1995","unstructured":"P. Erd\u0151s, A. S\u00e1rk\u00f6zy and V. T. S\u00f3s: On product representations of powers, I; European J. Combin. 16(6) (1995), 567\u2013588.","journal-title":"European J. Combin."},{"key":"2195_CR21","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/4347.001.0001","volume-title":"Low Density Parity Check Codes","author":"R. G. Gallager","year":"1963","unstructured":"R. G. Gallager: Low Density Parity Check Codes, MIT Press, Cambridge MA, 1963. Research Monograph Series, no. 21."},{"key":"2195_CR22","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1016\/S0012-365X(96)00184-7","volume":"165\/166","author":"E. Gy\u0151ri","year":"1997","unstructured":"E. Gy\u0151ri: C 6-free bipartite graphs and product representation of squares, Discrete Math. 165\/166 (1997), 371\u2013375. Graphs and combinatorics (Marseille, 1995).","journal-title":"Discrete Math."},{"issue":"2","key":"2195_CR23","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1006\/jctb.2002.2123","volume":"86","author":"S. Hoory","year":"2002","unstructured":"S. Hoory: The size of bipartite graphs with a given girth, J. Combin. Theory Ser. B 86(2) (2002), 215\u2013220.","journal-title":"J. Combin. Theory Ser. B"},{"key":"2195_CR24","unstructured":"N. Kahale and R. Urbanke: On the minimum distance of parallel and serially concatenated codes, IEEE Trans. Inform. Theory, to appear."},{"key":"2195_CR25","series-title":"2697","doi-asserted-by":"crossref","first-page":"112","DOI":"10.1007\/3-540-45071-8_13","volume-title":"Computing and combinatorics","author":"H. Lefmann","year":"2003","unstructured":"H. Lefmann: Sparse parity-check matrices over finite fields (extended abstract), in: Computing and combinatorics, volume 2697 of Lecture Notes in Comput. Sci., pages 112\u2013121, Springer, Berlin, 2003."},{"issue":"2","key":"2195_CR26","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1023\/A:1008233013327","volume":"12","author":"H. Lefmann","year":"1997","unstructured":"H. Lefmann, P. Pudl\u00e1k and P. Savick\u00fd: On sparse parity check matrices, Des. Codes Cryptogr. 12(2) (1997), 107\u2013130.","journal-title":"Des. Codes Cryptogr."},{"issue":"2","key":"2195_CR27","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1109\/18.748992","volume":"45","author":"D. J. C. MacKay","year":"1999","unstructured":"D. J. C. MacKay: Good error-correcting codes based on very sparse matrices, IEEE Trans. Inform. Theory 45(2) (1999), 399\u2013431.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2195_CR28","series-title":"North-Holland Mathematical Library","volume-title":"The theory of error-correcting codes, I","author":"F. J. Mac Williams","year":"1977","unstructured":"F. J. Mac Williams and N. J. A. Sloane: The theory of error-correcting codes, I; North-Holland Publishing Co., Amsterdam, 1977, North-Holland Mathematical Library, Vol. 16."},{"key":"2195_CR29","volume-title":"The theory of error-correcting codes, II","author":"F. J. MacWilliams","year":"1977","unstructured":"F. J. MacWilliams and N. J. A. Sloane: The theory of error-correcting codes, II; North-Holland Publishing Co., Amsterdam, 1977, North-Holland Mathematical Library, Vol. 16."},{"issue":"5\u20136","key":"2195_CR30","doi-asserted-by":"crossref","first-page":"845","DOI":"10.1017\/S0963548305007029","volume":"14","author":"A. Naor","year":"2005","unstructured":"A. Naor and J. Verstra\u00ebte: A note on bipartite graphs without 2k-cycles, Combin. Probab. Comput. 14(5\u20136) (2005), 845\u2013849.","journal-title":"Combin. Probab. Comput."},{"issue":"12","key":"2195_CR31","first-page":"1473","volume":"43","author":"C. Pomerance","year":"1996","unstructured":"C. Pomerance: A tale of two sieves, Notices Amer. Math. Soc. 43(12) (1996), 1473\u20131485.","journal-title":"Notices Amer. Math. Soc."},{"key":"2195_CR32","first-page":"967","volume-title":"Handbook of combinatorics","author":"C. Pomerance","year":"1995","unstructured":"C. Pomerance and A. S\u00e1rk\u00f6zy: Combinatorial number theory, in: Handbook of combinatorics, Vol. 1, 2, pages 967\u20131018, Elsevier, Amsterdam, 1995."},{"issue":"3","key":"2195_CR33","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1002\/jgt.3190190305","volume":"19","author":"G. N. S\u00e1rk\u00f6zy","year":"1995","unstructured":"G. N. S\u00e1rk\u00f6zy: Cycles in bipartite graphs and an application in number theory, J. Graph Theory 19(3) (1995), 323\u2013331.","journal-title":"J. Graph Theory"},{"issue":"6\/1","key":"2195_CR34","doi-asserted-by":"crossref","first-page":"1710","DOI":"10.1109\/18.556667","volume":"42","author":"M. Sipser","year":"1996","unstructured":"M. Sipser and D. A. Spielman: Expander codes, IEEE Trans. Inform. Theory 42(6\/1) (1996), 1710\u20131722. Codes and complexity.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"6\/1","key":"2195_CR35","doi-asserted-by":"crossref","first-page":"1723","DOI":"10.1109\/18.556668","volume":"42","author":"D. A. Spielman","year":"1996","unstructured":"D. A. Spielman: Linear-time encodable and decodable error-correcting codes, IEEE Trans. Inform. Theory 42(6\/1) (1996), 1723\u20131731. Codes and complexity.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"4","key":"2195_CR36","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1017\/S0963548300004478","volume":"9","author":"J. Verstra\u00ebte","year":"2000","unstructured":"J. Verstra\u00ebte: On arithmetic progressions of cycle lengths in graphs, Combin. Probab. Comput. 9(4) (2000), 369\u2013373.","journal-title":"Combin. Probab. Comput."},{"key":"2195_CR37","series-title":"Proc. Sympos. Appl. Math.","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1090\/psapm\/048\/1314885","volume-title":"Mathematics of Computation 1943\u20131993: a half-century of computational mathematics (Vancouver, BC, 1993)","author":"H. C. Williams","year":"1994","unstructured":"H. C. Williams and J. O. Shallit: Factoring integers before computers, in: Mathematics of Computation 1943\u20131993: a half-century of computational mathematics (Vancouver, BC, 1993), volume 48 of Proc. Sympos. Appl. Math., pages 481\u2013531, Amer. Math. Soc., Providence, RI, 1994."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-008-2195-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00493-008-2195-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-008-2195-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T01:32:45Z","timestamp":1559093565000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00493-008-2195-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,3]]},"references-count":37,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2008,3]]}},"alternative-id":["2195"],"URL":"https:\/\/doi.org\/10.1007\/s00493-008-2195-2","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,3]]}}}