Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
169 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Infinite families of $t$-designs from a type of five-weight codes (1607.04815v1)

Published 17 Jul 2016 in cs.IT, math.CO, and math.IT

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.

Citations (6)

Summary

We haven't generated a summary for this paper yet.