{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T11:41:04Z","timestamp":1773229264974,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540601142","type":"print"},{"value":"9783540494409","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60114-7_10","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:41:45Z","timestamp":1330278105000},"page":"131-145","source":"Crossref","is-referenced-by-count":13,"title":["The discovery of simple 7-designs with automorphism group P\u0393L(2, 32)"],"prefix":"10.1007","author":[{"given":"Anton","family":"Betten","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Adalbert","family":"Kerber","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Axel","family":"Kohnert","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Reinhard","family":"Laue","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alfred","family":"Wassermann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"10_CR1","unstructured":"E. Arnold: \u00c4quivalenzklassen linearer Codes, Zulassungsarbeit Bayreuth 1993."},{"key":"10_CR2","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/978-1-4684-4730-9_2","volume-title":"Advances in Cryptology, Proceedings of Crypto '83","author":"E. F. Brickell","year":"1984","unstructured":"E. F. Brickell: Solving low density knapsacks. Advances in Cryptology, Proceedings of Crypto '83, Plenum Press, New York (1984), 25\u201337."},{"key":"10_CR3","first-page":"54","volume":"547","author":"M. J. Coster","year":"1991","unstructured":"M. J. Coster, B. A. LaMacchia, A. M. Odlyzko, C. P. Schnorr: An improved low-density subset sum algorithm. Proceedings EUROCRYPT '91, Brighton, May 1991 in Springer Lecture Notes in Computer Science547 (1991), 54\u201367.","journal-title":"Proceedings EUROCRYPT '91, Brighton, May 1991 in Springer Lecture Notes in Computer Science"},{"key":"10_CR4","unstructured":"M. R. Garey, D. S. Johnson: Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman and Company (1979)."},{"key":"10_CR5","volume-title":"Disquisitiones Arithmeticae","author":"C. F. Gauss","year":"1965","unstructured":"C. F. Gauss: Disquisitiones Arithmeticae, German edition by H. Maser, Chelsea Pub., New York (1965).","edition":"German edition"},{"key":"10_CR6","doi-asserted-by":"crossref","first-page":"366","DOI":"10.1007\/BF01442795","volume":"6","author":"A. Korkine","year":"1873","unstructured":"A. Korkine, G. Zolotareff, Sur les forms quadratiques. Math. Ann.6 (1873), 366\u2013389.","journal-title":"Math. Ann."},{"key":"10_CR7","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/0012-365X(76)90030-3","volume":"15","author":"E. S. Kramer","year":"1976","unstructured":"E. S. Kramer, D. M. Mesner: t-designs on hypergraphs. Discrete Math.15 (1976), 263\u2013296.","journal-title":"Discrete Math."},{"key":"10_CR8","first-page":"235","volume":"55","author":"D. L. Kreher","year":"1986","unstructured":"D. L. Kreher, S. P. Radziszowski: Finding Simple t-Designs by Using Basis Reduction. Congressus Numerantium55 (1986), 235\u2013244.","journal-title":"Congressus Numerantium"},{"key":"10_CR9","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1145\/2455.2461","volume":"32","author":"J. C. Lagarias","year":"1985","unstructured":"J. C. Lagarias, A. M. Odlyzko: Solving low-density subset sum problems. J. Assoc. Comp. Mach.32 (1985), 229\u2013246.","journal-title":"J. Assoc. Comp. Mach."},{"key":"10_CR10","first-page":"53","volume":"43","author":"R. Laue","year":"1993","unstructured":"R. Laue: Construction of combinatorial objects \u2014 A tutorial. Bayreuther Math. Schr.43 (1993), 53\u201396.","journal-title":"Bayreuther Math. Schr."},{"key":"10_CR11","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1007\/BF01457454","volume":"261","author":"A. K. Lenstra","year":"1982","unstructured":"A. K. Lenstra, H. W. Lenstra Jr., L. Lov\u00e1sz: Factoring Polynomials with Rational Coefficients, Math. Ann.261 (1982), 515\u2013534.","journal-title":"Math. Ann."},{"key":"10_CR12","doi-asserted-by":"crossref","unstructured":"M. W. Liebeck, C. E. Praeger, J. Saxl: The maximal factorizations of the finite simple groups and their automorphism groups, Memoirs of the Amer. Math. Soc. 432(1990), Chapter 9.","DOI":"10.1090\/memo\/0432"},{"key":"10_CR13","unstructured":"S. Magliveras, D. W. Leavitt: Simple 6-(33, 8, 36) designs from P\u0393L 2(32), Computational Group Theory, M. D. Atkinson ed., Academic Press 1984, 337\u2013352."},{"key":"10_CR14","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1002\/jcd.3180010204","volume":"1","author":"B. Schmalz","year":"1993","unstructured":"B. Schmalz: The t-designs with prescribed automorphism group, new simple 6-designs. J. Combinatorial Designs1 (1993), 125\u2013170.","journal-title":"J. Combinatorial Designs"},{"key":"10_CR15","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/0304-3975(87)90064-8","volume":"53","author":"C. P. Schnorr","year":"1987","unstructured":"C. P. Schnorr: A hierachy of polynomial time lattice basis reduction algorithms. Theoretical Computer Science53 (1987), 201\u2013224.","journal-title":"Theoretical Computer Science"},{"key":"10_CR16","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0196-6774(88)90004-1","volume":"9","author":"C. P. Schnorr","year":"1988","unstructured":"C. P. Schnorr: A More Efficient Algorithm for Lattice Basis Reduction. J. Algorithms9 (1988), 47\u201362.","journal-title":"J. Algorithms"},{"key":"10_CR17","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1007\/3-540-54458-5_51","volume":"529","author":"C. P. Schnorr","year":"1991","unstructured":"C. P. Schnorr, M. Euchner: Lattice basis reduction: Improved practical algorithms and solving subset sum problems. Proceedings of Fundamentals of Computation Theory 91 in Lecture Notes in Computer Science529 (1991), 68\u201385.","journal-title":"Proceedings of Fundamentals of Computation Theory 91 in Lecture Notes in Computer Science"},{"key":"10_CR18","first-page":"118","volume-title":"Algebraic Coding Theory: History and Development (Benchmark papers in electrical engineering and computer science)","author":"D. Slepian","year":"1973","unstructured":"D. Slepian: Some further theory of group codes. In I. F. Blake: Algebraic Coding Theory: History and Development (Benchmark papers in electrical engineering and computer science), Stroudsburg, Dowden, Hutchinson & Ross Inc. (1973), 118\u2013151."},{"key":"10_CR19","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1016\/0012-365X(87)90061-6","volume":"65","author":"L. Teirlinck","year":"1987","unstructured":"L. Teirlinck: Non trivial t-designs without repeated blocks exist for all t. Discrete Mathematics65 (1987), 301\u2013311.","journal-title":"Discrete Mathematics"},{"key":"10_CR20","unstructured":"S. Weinrich: Konstruktionsalgorithmen f\u00fcr diskrete Strukturen und ihre Implementierung, Diplomarbeit Bayreuth (1993), 274 pp."}],"container-title":["Lecture Notes in Computer Science","Applied Algebra, Algebraic Algorithms and Error-Correcting Codes"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60114-7_10.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:31:42Z","timestamp":1619573502000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60114-7_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540601142","9783540494409"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-60114-7_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995]]}}}