Journal ArticleDOI
Construction of 3-designs using parallelism
TLDR
In this paper, recursive constructions for simple 3-designs have been proposed, which are generalization of several recent results obtained by the author and prove to be very useful.Abstract:
This paper concerns recursive constructions for simple 3-designs. These are generalization of several recent results obtained by the author. The methods are based on 3-designs having a parallelism and prove to be very useful. Illustrative applications are included to demonstrate their surprising strength and as a result new infinite families of 3-designs are constructed.read more
Citations
More filters
Journal ArticleDOI
Multiply Constant-Weight Codes and the Reliability of Loop Physically Unclonable Functions
Yeow Meng Chee,Zouha Cherif,Jean-Luc Danger,Sylvain Guilley,Han Mao Kiah,Jon-Lark Kim,Patrick Solé,Xiande Zhang +7 more
TL;DR: The class of multiply constant-weight codes is introduced to improve the reliability of certain physically unclonable function response, and classical coding methods are extended to construct multiply Constant Weight Codes from known \(q\) -ary and constant- weight codes.
Posted Content
Multiply Constant-Weight Codes and the Reliability of Loop Physically Unclonable Functions
Yeow Meng Chee,Zouha Cherif,Jean-Luc Danger,Sylvain Guilley,Han Mao Kiah,Jon-Lark Kim,Patrick Solé,Xiande Zhang +7 more
TL;DR: In this article, the authors introduce the class of multiply constant-weight codes to improve the reliability of certain physically unclonable function (PUF) response, and derive analogues of Johnson bounds to a constant factor under certain conditions.
Journal ArticleDOI
Unifying some known infinite families of combinatorial 3-designs
TL;DR: The basic construction generalizes a well-known construction of simple 3-(v,4,3) designs by Jungnickel and Vanstone (1986) and investigates the conditions under which the designs obtained by the basic construction are simple.
Journal ArticleDOI
Resolvable t -Designs
TL;DR: This work gives some visualizations of Steiner systems which make resolvability obvious and some known Steiner 5-designs are assembled from such resolvable 3- designs such that they are also resolable.
Journal ArticleDOI
Construction of 3-designs using $(1,\sigma)$-resolution
TL;DR: In this paper, recursive constructions for simple 3-designs based on the concept of $(1, σ)-resolution are presented. Butler and Srinivasan showed that these constructions can be used to produce many previously unknown infinite families of simple 3 -designs.
References
More filters
BookDOI
CRC Handbook of Combinatorial Designs
TL;DR: Balanced Incomplete Block Designs and t-Designs2-(v,k,l) Designs of Small OrderBIBDs with Small Block Sizet-designs, t = 3Steiner SystemsSymmetric DesignsResolvable and Near Resolvable DesignsLatin Squares, MOLS, and Orthogonal ArraysLatin SquareMutually Orthogonomic Latin Squares (MOLS)Incomplete MOLsOrthogonal ARrays of Index More Than OneOrthoghonal Array of Strength More Than TwoPairwise Balanced Designs
Journal ArticleDOI
Recursive constructions for 3-designs and resolvable 3-designs
TL;DR: In this article, the authors presented several recursive constructions for 3-designs and resolvable 3-decomposition, which assume the existence of a family of 3-Decomposition 3-Designs with parameters 3 − (2 j.3.2 n −1)) for any integer n⩾3.