Construction of 3-Designs Using (1,σ)-Resolution

2016/03/07 by Trung Van Tran, Van Tran, Trung
Engineering · Computer Science · Mathematics · #graph theory and CDMA systems #Coding theory and cryptography #Rings, Modules, and Algebras

paper · pdf · doi:10.48550/arxiv.1603.02025

Abstract

The paper deals with recursive constructions for simple 3-designs based on other 3-designs having (1, σ)-resolution. The concept of (1, σ)-resolution may be viewed as a generalization of the parallelism for designs. We show the constructions and their applications to produce many previously unknown infinite families of simple 3-designs. We also include a discussion of (1,σ)-resolvability of the constructed designs.

Related

• A new look at an old construction: constructing (simple) 3-designs from resolvable 2-designs
• A recursive construction for simple t-designs using resolution
• Uniformly resolvable (C₄, K_1,3)-designs of order v and index 2
• Infinite families of 2-designs and 3-designs from linear codes
• Binary (k,k)-designs