The discovery of simple 7-designs with automorphism group PΓL(2, 32)-Reference-Cited by-同舟云学术

The discovery of simple 7-designs with automorphism group PΓL(2, 32)

Published:1995 Issue: Volume: Page:131-145
ISSN:0302-9743
Container-title:Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
language:
Short-container-title:

Author:

Betten Anton,Kerber Adalbert,Kohnert Axel,Laue Reinhard,Wassermann Alfred

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-60114-7_10.pdf

Reference20 articles.

1. E. Arnold: Äquivalenzklassen linearer Codes, Zulassungsarbeit Bayreuth 1993.

2. E. F. Brickell: Solving low density knapsacks. Advances in Cryptology, Proceedings of Crypto '83, Plenum Press, New York (1984), 25–37.

3. 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–67.

4. M. R. Garey, D. S. Johnson: Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman and Company (1979).

5. C. F. Gauss: Disquisitiones Arithmeticae, German edition by H. Maser, Chelsea Pub., New York (1965).

Cited by 11 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Constructions for t-designs and s-resolvable t-designs;Designs, Codes and Cryptography;2024-06-27

2. Search for Combinatorial Objects Using Lattice Algorithms – Revisited;Lecture Notes in Computer Science;2021

3. Some New Families of 2-Resolutions;50 Years of Combinatorics, Graph Theory, and Computing;2019-11-15

4. Computational Methods in Subspace Designs;Network Coding and Subspace Designs;2018

5. A recursive construction for simple t-designs using resolutions;Designs, Codes and Cryptography;2017-07-20