{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:47:45Z","timestamp":1725493665310},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540405344"},{"type":"electronic","value":"9783540450719"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-45071-8_13","type":"book-chapter","created":{"date-parts":[[2007,10,27]],"date-time":"2007-10-27T08:04:43Z","timestamp":1193472283000},"page":"112-121","source":"Crossref","is-referenced-by-count":2,"title":["Sparse Parity-Check Matrices over Finite Fields"],"prefix":"10.1007","author":[{"given":"Hanno","family":"Lefmann","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,6,24]]},"reference":[{"key":"13_CR1","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1016\/0097-3165(82)90049-8","volume":"32","author":"M. Ajtai","year":"1982","unstructured":"M. Ajtai, J. K\u00f3mlos, J. Pintz, J. Spencer and E. Szemer\u00e9di, Extremal uncrowded hypergraphs, J. Comb. Theory A 32, 1982, 321\u2013335.","journal-title":"J. Comb. Theory A"},{"key":"13_CR2","doi-asserted-by":"publisher","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, Rand. Struct. & Algorithms 3, 1992, 289\u2013304, and 4, 1993, 119\u2013120.","journal-title":"Rand. Struct. & Algorithms"},{"key":"13_CR3","doi-asserted-by":"crossref","first-page":"1091","DOI":"10.4153\/CJM-1966-109-8","volume":"18","author":"C. T. Benson","year":"1966","unstructured":"C. T. Benson, Minimal regular graphs of girth eight and twelve, Canad. J. Mathematics 18, 1966, 1091\u20131094.","journal-title":"Canad. J. Mathematics"},{"key":"13_CR4","doi-asserted-by":"publisher","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, Comb., Prob. and Computing 8, 1999, 417\u2013427.","journal-title":"Comb., Prob. and Computing"},{"key":"13_CR5","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1137\/S0097539797323716","volume":"29","author":"C. Bertram-Kretzberg","year":"1999","unstructured":"C. Bertram-Kretzberg and H. Lefmann, The algorithmic aspects of uncrowded hypergraphs, SIAM J. Computing 29, 1999, 201\u2013230.","journal-title":"SIAM J. Computing"},{"key":"13_CR6","doi-asserted-by":"publisher","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, MOD\n                           \n                    p\n                  -tests, almost independence and small probability spaces, Rand. Struct. & Algorithms 16, 2000, 293\u2013313.","journal-title":"Rand. Struct. & Algorithms"},{"key":"13_CR7","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/0095-8956(74)90052-5","volume":"16","author":"A. Bondy","year":"1974","unstructured":"A. Bondy and M. Simonovits, Cycles of even length in graphs, J. Comb. Theory Ser. B 16, 1974, 97\u2013105.","journal-title":"J. Comb. Theory Ser. B"},{"key":"13_CR8","doi-asserted-by":"crossref","first-page":"281","DOI":"10.4153\/CMB-1966-036-2","volume":"9","author":"W. G. Brown","year":"1966","unstructured":"W. G. Brown, On graphs that do not contain a Thomsen graph, Canad. Math. Bulletin 9, 1966, 281\u2013289.","journal-title":"Canad. Math. Bulletin"},{"key":"13_CR9","first-page":"213","volume":"1","author":"P. Erd\u00f6s","year":"1966","unstructured":"P. Erd\u00f6s, A. R\u00e9nyi and V. T. S\u00f3s, On a problem of graph theory, Stud. Sci. Math. Hungarica 1, 1966, 213\u2013235.","journal-title":"Stud. Sci. Math. Hungarica"},{"key":"13_CR10","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1002\/(SICI)1098-2418(199603)8:2<131::AID-RSA4>3.0.CO;2-Z","volume":"8","author":"A. Fundia","year":"1996","unstructured":"A. Fundia, Derandomizing Chebychev\u2019s inequality to find independent sets in uncrowded hypergraphs, Rand. Struct. & Algorithms 8, 1996, 131\u2013147.","journal-title":"Rand. Struct. & Algorithms"},{"key":"13_CR11","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1016\/0022-314X(86)90091-0","volume":"23","author":"P. Frankl","year":"1986","unstructured":"P. Frankl and Z. F\u00fcredi, Union-free families of sets and equations over fields, J. Numb. Theory 23, 1986, 210\u2013218.","journal-title":"J. Numb. Theory"},{"key":"13_CR12","doi-asserted-by":"crossref","unstructured":"H. Karloff and Y. Mansour, On construction of k-wise independent random variables, Proc. 26th STOC, 1994, 564\u2013573.","DOI":"10.1145\/195058.195409"},{"key":"13_CR13","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1090\/S0273-0979-1995-00569-0","volume":"32","author":"F. Lazebnik","year":"1995","unstructured":"F. Lazebnik, V. A. Ustimenko and A. J. Woldar, A new series of dense graphs of high girth, Bull. (New Series) of the AMS 32, 1995, 73\u201379.","journal-title":"Bull. (New Series) of the AMS"},{"key":"13_CR14","doi-asserted-by":"publisher","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, Designs, Codes and Cryptography 12, 1997, 107\u2013130.","journal-title":"Designs, Codes and Cryptography"},{"key":"13_CR15","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/BF02126799","volume":"8","author":"A. Lubotzky","year":"1988","unstructured":"A. Lubotzky, R. Phillips and P. Sarnak, Ramanujan graphs, Combinatorica 8, 1988, 261\u2013277.","journal-title":"Combinatorica"},{"key":"13_CR16","doi-asserted-by":"crossref","unstructured":"M. Luby, M. Mitzenmacher, A. Shokrollahi and D. Spielman, Analysis of low-density codes and improved designs using irregular graphs, Proc. 30th STOC, 1998, 249\u2013258.","DOI":"10.1145\/276698.276756"},{"key":"13_CR17","first-page":"39","volume":"24","author":"G. A. Margulis","year":"1988","unstructured":"G. A. Margulis, Explicit group theoretical construction of combinatorial schemes and their application to the design of expanders and concentrators, J. Probl. Inform. Transm. 24, 1988, 39\u201346.","journal-title":"J. Probl. Inform. Transm."},{"key":"13_CR18","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/0095-8956(91)90097-4","volume":"52","author":"R. Wenger","year":"1991","unstructured":"R. Wenger, Extremal graphs with no C\n                           4\u2019s, C\n                           6\u2019s or C\n                           10\u2019s, J. Comb. Theory Ser. B 52, 1991, 113\u2013116.","journal-title":"J. Comb. Theory Ser. B"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45071-8_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,24]],"date-time":"2019-02-24T15:50:02Z","timestamp":1551023402000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45071-8_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540405344","9783540450719"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-45071-8_13","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}