Titlebook: Codes, Designs and Geometry; Vladimir Tonchev Book 1996 Kluwer Academic Publishers 1996 Permutation.algebra.geometry.theorem

使虛弱

Dongmei Zhao,Guoqing Ji,Shuiguang ZengIn this paper, we examine greedily generated self-orthogonal codes. We show that they are linear, and discuss several properties which they possess. We also look at specific examples of these codes.

綁架

Mingwu Zhang,Zhen-An Li,Peihang ZhangSome recent results on .-arcs and hyperovals of .(2, .), on partial flocks and flocks of quadratic cones of .(3, .), and on line spreads in .(3, .) are surveyed. Also, there is an appendix on how to use Veronese varieties as tools in proving theorems.

JAMB

MAG

改變

antidepressant

,-Arcs, Hyperovals, Partial Flocks and Flocks,Some recent results on .-arcs and hyperovals of .(2, .), on partial flocks and flocks of quadratic cones of .(3, .), and on line spreads in .(3, .) are surveyed. Also, there is an appendix on how to use Veronese varieties as tools in proving theorems.

travail

A Generalization of a Theorem of Dehon for Simple ,-Designs,A generalization of a theorem of Dehon for simple t-designs is proved. Several new families of 4- and 5-designs having certain additional property regarding their block intersection numbers are obtained by applying this result.

Endometrium

https://doi.org/10.1007/978-981-16-7913-1... We study the latter type of objects. These may also be viewed as generalizations of .-homogeneous groups of permutations. Several construction techniques are given. Here we concentrate on the optimal case, where the number of permutations attains the lower bound. We obtain several new optimal su

演講

Yanzi Li,Jing Zhang,Peng Gao,Sitong Shiof the binary .-greedy codes as well as the triangular greedy codes over arbitrary fields. One method generalizes to arbitrary orderings over arbitrary finite fields while the other method generalizes the .-greedy codes to linear codes over arbitrary finite fields. Examples of the first method are c

Veneer

Qingru Ma,Tianqi Zhou,Haowen Tan .. and their matrices of the regular representation of ... Recently we characterized the Hadamard matrices of order 28 ([6] and [7]). There are exactly 487 Hadamard matrices of order 28, up to equivalence. In these matrices there exist matrices with some interesting properties. That is, these are c