"There Exists a Simple Non Trivial t-design with an Arbitrarily Large ..."

Michel Sebille (2001)

> Home

Details and statistics

DOI: —

access: unavailable

type: Journal Article

metadata version: 2019-06-17

- no documents available
- export record
  dblp key:
  - journals/dcc/Sebille01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dcc/Sebille01
Michel Sebille:
There Exists a Simple Non Trivial t-design with an Arbitrarily Large Automorphism Group for Every t. Des. Codes Cryptogr. 22(3): 215-219 (2001)

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.