Archiv der Mathematik

April 1992, Volume 58, Issue 4, pp 338–344 | Cite as

Monotypical uniformly homogeneous sets of permutations

• Authors
• Authors and affiliations

• Jürgen Bierbrauer

Article

Received: 30 November 1990

• 40 Downloads
• 2 Citations

This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

References

1. [1]
   J.Bierbrauer andTran van Trung, Some highly symmetric authentication perpendicular arrays. Submitted to Designs, Codes and Cryptography.Google Scholar
2. [2]
   J.Bierbrauer andTran van Trung, Halving PGL (2, 2^f),f odd: a series of cryptocodes. To appear in Designs, Codes and Cryptography.Google Scholar
3. [3]
   I. Kaplansky, Solution of the “Problème des ménages”. Bull. Amer. Math. Soc.49, 784–785 (1943).Google Scholar
4. [4]
   J.Riordan, Combinatorial Identities. Huntington, New York, 1979,¹1968.Google Scholar
5. [5]
   D. R. Stinson andL. Teirlinck, A construction for authentication/secrecy codes from 3-homogeneous permutation groups. European J. Combin.11, 73–79 (1990).Google Scholar
6. [6]
   H.Wilf, The ‘Snake-Oil’ method for proving combinatorial identities. Surveys in Combinatorics, J. Siemens Ed., Cambridge 1989.Google Scholar

Copyright information

© Birkhäuser Verlag 1992

Authors and Affiliations

• Jürgen Bierbrauer
  • 1

1. 1.Mathematisches InstitutUniversität HeidelbergHeidelberg