Papers
Topics
Authors
Recent
Search
2000 character limit reached

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

Published 17 Jul 2016 in cs.IT, math.CO, and math.IT | (1607.04815v1)

Abstract: It has been known for a long time that tt-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 tt-design. While a lot of progress in the direction of constructing codes from tt-designs has been made, only a small amount of work on the construction of tt-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 mm and the block size of the designs varies in a huge range.

Authors (1)
Citations (6)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.