nach oben

Designs, Codes and Cryptography

Erschienen in:

02.07.2016

Simple t-designs: a recursive construction for arbitrary t

verfasst von: Tran van Trung

Erschienen in: Designs, Codes and Cryptography | Ausgabe 3/2017

Einloggen, um Zugang zu erhalten

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config

KI-gestützte Suche

Aus

Abstract

The aim of this paper is to present a recursive construction of simple t-designs for arbitrary t. The construction is of purely combinatorial nature and it requires finding solutions for the indices of the ingredient designs that satisfy a certain set of equalities. We give a small number of examples to illustrate the construction, whereby we have found a large number of new t-designs, which were previously unknown. This indicates that the method is useful and powerful.

Nächster Artikel Quantum MDS codes with large minimum distance

Ajoodani-Namini S.: Extending large sets of \(t\)-designs. J. Combin. Theory A 76, 139–144 (1996).

Beth T., Jungnickel D., Lenz H.: Design Theory, 2nd edn. Cambridge University Press, Cambridge (1999).

Betten A., Kerber A., Kohnert A., Laue R., Wassermann A.: The discovery of simple 7-designs with automorphism group \(P\Gamma L(2,32)\). In: Cohen G., Giusti M., Mora T. (eds.) Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, pp. 131–145. Springer, New York (1995).

Betten A., Kerber A., Laue R., Wassermann A.: Simple 8-designs with small parameters. Des. Codes Cryptogr. 15, 5–27 (1998).

Betten A., Laue R., Wassermann A.: A Steiner 5-design on 36 points. Des. Codes Cryptogr. 17, 181–186 (1999).

Bierbrauer J.: A family of 4-designs with block size 9. Discret. Math. 138, 113–117 (1995).

Bierbrauer J.: A family of 4-designs. Graphs Comb. 11, 209–212 (1995).

Colbourn C. J., Dinitz J. H., (eds.): Handbook of Combinatorial Designs, 2nd edn. CRC Press, Boca Raton (2007).

Denniston R.H.F.: Some new 5-designs. Bull. Lond. Math. Soc. 8, 263–267 (1976).

10.

Driessen L.H.M.E.: \(t\)-Designs, \(t\ge 3\). Technical Report, Department of Mathematics, Technische Hogeschool Eindhoven, The Netherlands (1978).

11.

Jimbo M., Kunihara Y., Laue R., Sawa M.: Unifying some infinite families of combinatorial 3-designs. J. Combin. Theory A 118, 1072–1085 (2011).

12.

Khosrovshahi G.B., Ajoodani-Namini S.: Combining \(t\)-designs. J. Combin. Theory Ser. A 58, 26–34 (1991).

13.

Kramer E.S., Mesner D.M.: \(t\)-Designs on hypergraphs. Discret. Math. 15, 263–296 (1976).

14.

Kramer E.S., Magliveras S.S., O’Brien E.A.: Some new large sets of t-designs. Australas. J. Combin. 7, 189–193 (1993).

15.

Kreher D.L.: An infinite family of (simple) 6-designs. J. Combin. Des. 1, 277–280 (1993).

16.

Magliveras S.S., Leavitt D.M.: Simple 6-(33,8,36)-Designs from \(P\Gamma L_2(32)\), Computational Group Theory, pp. 337–352. Academic Press, New York (1984).

17.

Magliveras S.S., Plambeck T.E.: New infinite families of simple 5-designs. J. Combin. Theory A 44, 1–5 (1987).

18.

Sebille M.: There exists a simple non-trivial \(t\)-design with an arbitrarily large automorphism group for every \(t\). Des. Codes Cryptogr. 22, 203–206 (2001).

19.

Teirlinck L.: Non-trivial \(t\)-designs without repeated blocks exist for all \(t\). Discret. Math. 65, 301–311 (1987).

20.

Teirlinck L.: Locally trivial \(t-\)designs and \(t\)-designs without repeated blocks. Discret. Math. 77, 345–356 (1989).

21.

Tuan N.D.: Simple non-trivial designs with an arbitrary automorphism group. J. Combin. Theory A 100, 403–408 (2002).

22.

van Trung T.: The existence of an infinite family of simple 5-designs. Math. Z. 187, 285–287 (1984).

23.

van Trung T.: On the construction of \(t\)-designs and the existence of some new infinite families of simple 5-designs. Arch. Math. 47, 187–192 (1986).

24.

van Trung T.: Recursive constructions for 3-designs and resolvable 3-designs. J. Stat. Plan. Infer. 95, 341–358 (2001).

25.

Wu Q.: A note on extending \(t\)-designs. Australas. J. Comb. 4, 229–235 (1991).

Titel: Simple t-designs: a recursive construction for arbitrary t
verfasst von: Tran van Trung
Publikationsdatum: 02.07.2016
Verlag: Springer US
Erschienen in: Designs, Codes and Cryptography / Ausgabe 3/2017
Print ISSN: 0925-1022
Elektronische ISSN: 1573-7586
DOI: https://doi.org/10.1007/s10623-016-0238-z

Springer Professional

Abstract

Bitte loggen Sie sich ein, um Zugang zu Ihrer Lizenz zu erhalten.

Weitere Artikel der Ausgabe 3/2017

Proof of a conjecture of Kløve on permutation codes under the Chebychev distance

Quantum MDS codes with large minimum distance

An optimal representation for the trace zero subgroup

Extending permutation arrays: improving MOLS bounds

On the roots and minimum rank distance of skew cyclic codes

Multiple point compression on elliptic curves