اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديد$q$-analogs of group divisible designs
132
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
A well known class of objects in combinatorial design theory are {group divisible designs}. Here, we introduce the $q$-analogs of group divisible designs. It turns out that there are interesting connections to scattered subspaces, $q$-Steiner systems, design packings and $q^r$-divisible projective sets. We give necessary conditions for the existence of $q$-analogs of group divsible designs, construct an infinite series of examples, and provide further existence results with the help of a computer search. One example is a $(6,3,2,2)_2$ group divisible design over $operatorname{GF}(2)$ which is a design packing consisting of $180$ blocks that such every $2$-dimensional subspace in $operatorname{GF}(2)^6$ is covered at most twice.
قيم البحث
اقرأ أيضاً
A projective linear code over $mathbb{F}_q$ is called $Delta$-divisible if all weights of its codewords are divisible by $Delta$. Especially, $q^r$-divisible projective linear codes, where $r$ is some integer, arise in many applications of collection
s of subspaces in $mathbb{F}_q^v$. One example are upper bounds on the cardinality of partial spreads. Here we survey the known results on the possible lengths of projective $q^r$-divisible linear codes.
The Assmus-Mattson theorem gives a way to identify block designs arising from codes. This result was broadened to matroids and weighted designs. In this work we present a further two-fold generalisation: first from matroids to polymatroids and also f
rom sets to vector spaces. To achieve this, we introduce the characteristic polynomial of a $q$-polymatroid and outline several of its properties.
For which positive integers $n,k,r$ does there exist a linear $[n,k]$ code $C$ over $mathbb{F}_q$ with all codeword weights divisible by $q^r$ and such that the columns of a generating matrix of $C$ are projectively distinct? The motivation for study
ing this problem comes from the theory of partial spreads, or subspace codes with the highest possible minimum distance, since the set of holes of a partial spread of $r$-flats in $operatorname{PG}(v-1,mathbb{F}_q)$ corresponds to a $q^r$-divisible code with $kleq v$. In this paper we provide an introduction to this problem and report on new results for $q=2$.
In this paper we investigate combinatorial constructions for $w$-cyclic holely group divisible packings with block size three (briefly by $3$-HGDPs). For any positive integers $u,v,w$ with $uequiv0,1~(bmod~3)$, the exact number of base blocks of a ma
ximum $w$-cyclic $3$-HGDP of type $(u,w^v)$ is determined. This result is used to determine the exact number of codewords in a maximum three-dimensional $(utimes vtimes w,3,1)$ optical orthogonal code with at most one optical pulse per spatial plane and per wavelength plane.
The iterative absorption method has recently led to major progress in the area of (hyper-)graph decompositions. Amongst other results, a new proof of the Existence conjecture for combinatorial designs, and some generalizations, was obtained. Here, we
illustrate the method by investigating triangle decompositions: we give a simple proof that a triangle-divisible graph of large minimum degree has a triangle decomposition and prove a similar result for quasi-random host graphs.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
