pith. sign in

arxiv: 1607.04815 · v1 · pith:V7MUFLBUnew · submitted 2016-07-17 · 💻 cs.IT · math.CO· math.IT

Infinite families of t-designs from a type of five-weight codes

classification 💻 cs.IT math.COmath.IT
keywords designscodesbeenconstructfamiliesinfinitelineartype
0
0 comments X
read the original abstract

It has been known for a long time that $t$-designs can be employed to construct both linear and nonlinear codes and that the codewords of a fixed weight in a code may hold a $t$-design. While a lot of progress in the direction of constructing codes from $t$-designs has been made, only a small amount of work on the construction of $t$-designs from codes has been done. The objective of this paper is to construct infinite families of $2$-designs and $3$-designs from a type of binary linear codes with five-weights. The total number of $2$-designs and $3$-designs obtained in this paper are exponential in any odd $m$ and the block size of the designs varies in a huge range.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.