arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1903.07375math.CO
收藏

组合$t$ -特殊多项式设计

Combinatorial $t$-designs from special polynomials

Cunsheng Ding, Chunming Tang

摘要:

组合$t$ -设计在编码理论、有限几何和许多工程领域都有很好的应用。构造$t$ -设计有两种主要方法。其中之一是通过某些置换群的群作用,这些置换群在点集上是$t$ -传递的或$t$ -齐性的。另一种是编码理论。本文的目的是在有限域GF $(q)$上引入具有特殊多项式的$t$ -设计的两种构造方法,并得到具有有趣参数的$2$ -设计和$3$ -设计.定义了一类d-多项式,并用它来构造$2$ -设计.在第一种构造的框架下,证明了GF $(2^m)$上的每一个o-多项式都给出一个$2$ -设计,GF $(2^m)$上的每一个o-单项式都给出一个$3$ -设计.在第二种构造下,每个$o$ -多项式给出一个$3$ -设计.文中还提出了一些有待解决的问题和解决办法。

英文摘要:

Combinatorial $t$-designs have nice applications in coding theory, finite geometries and several engineering areas. There are two major methods of constructing $t$-designs. One of them is via group actions of certain permutation groups which are $t$-transitive or $t$-homogeneous on some point set. The other is a coding-theoretical one. The objectives of this paper are to introduce two constructions of $t$-designs with special polynomials over finite fields GF$(q)$, and obtain $2$-designs and $3$-designs with interesting parameters. A type of d-polynomials is defined and used to construct $2$-designs. Under the framework of the first construction, it is shown that every o-polynomial over GF$(2^m)$ gives a $2$-design, and every o-monomial over GF$(2^m)$ yields a $3$-design. Under the second construction, every $o$-polynomial gives a $3$-design. Some open problems and conjectures are also presented in this paper.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑