Infinite families of 2-designs and 3-designs from linear codes
Preprint
Abstract
The interplay between coding theory and $t$-designs started many years ago. While every $t$-design yields a linear code over every finite field, the largest $t$ for which an infinite family of $t$-designs is derived directly from a linear or nonlinear code is $t=3$. Sporadic $4$-designs and $5$-designs were derived from some linear codes of certain parameters. The major objective of this paper is to construct many infinite families of $2$-designs and $3$-designs from linear codes. The parameters of some known $t$-designs are also derived. In addition, many conjectured infinite families of $2$-designs are also presented.
Keywords
All Related Versions
This publication has 10 references indexed in Scilit:
- The dimension and minimum distance of two classes of primitive BCH codesFinite Fields and Their Applications, 2017
- Three-weight cyclic codes and their weight distributionsDiscrete Mathematics, 2016
- Codes from Difference Sets2014
- Hamming weights in irreducible cyclic codesDiscrete Mathematics, 2013
- The weight distribution of a class of linear codes from perfect nonlinear functionsIEEE Transactions on Information Theory, 2006
- Linear Codes From Perfect Nonlinear Mappings and Their Secret Sharing SchemesIEEE Transactions on Information Theory, 2005
- Fundamentals of Error-Correcting Codes2003
- On the weight enumeration of weights less than 2.5d of Reed—Muller codesInformation and Control, 1976
- On the weight structure of Reed-Muller codesIEEE Transactions on Information Theory, 1970
- The Existence and Construction of Balanced Incomplete Block DesignsThe Annals of Mathematical Statistics, 1961