Results 31 to 40 of about 14,988 (146)
, 2002 Self-dual codes are important because many of the best codes known are of this type and they have a rich mathematical theory. Topics covered in this survey include codes over F_2, F_3, F_4, F_q, Z_4, Z_m, shadow codes, weight enumerators, Gleason-Pierce ...
Rains, E. M., Sloane, N. J. A.
core +1 more source
Tables of subspace codes [PDF]
, 2019 One of the main problems of subspace coding asks for the maximum possible cardinality of a subspace code with minimum distance at least $d$ over $\mathbb{F}_q^n$, where the dimensions of the codewords, which are vector spaces, are contained in $K ...
Heinlein, Daniel +3 more
core +1 more source
, 2020 Bu tez Gruplara Bü lunebilen Tasarımlar (GDD'ler) uzerinedir. GDD'ler Kombina-oü ütoryel Tasarımlar Teorisindeki ana yapılardan birisidir. GDD'ler ilk defa 1975'deHanani tarafından tanımlanmıs ve o gunden bu yana mesala PBD, Frame ve BIBDş ügibi kombinatoryel yapıların insaasında sıkca kullanılmıstır.ş ş şBir GDD (X, G, B) uclusu ...
openaire +1 more source
AMS Subject Classification: 05B05, 05E30, 05C50.Strongly regular graph;Group divisible design;Deza graph;(v;k ...
Haemers, W.H. +2 more
core +1 more source
t-Divisible designs from imprimitive permutation groups
European Journal of Combinatorics, 1992 A \(t\)-divisible design \((t\)-DD) is known as a group divisible design if \(t=2\) and the size of a point class exceeds 1, and a \(t\)-DD is simply a \(t\)-design if a point class is of size 1. The author constructs \(t\)-DD's by means of \(R\)-permutation groups \((G,X,R)\), where \(R\) is an equivalence relation on the set \(X\) and \(G\) is an \(R\
openaire +1 more source
Maximal arcs and group divisible designs [PDF]
Bulletin of the Australian Mathematical Society, 1990 The existence of maximal arcs of a certain type in symmetric designs is shown to yield semiregular group divisible designs whose duals are also semiregular group divisible. Two infinite families of such group divisible designs are constructed. The group divisible designs in these families are, in general, not symmetric.
openaire +2 more sources
Conditions for Singular Incidence Matrices [PDF]
Suppose one looks for a square integral matrixN, for which NN has a prescribed form.Then the Hasse-Minkowski invariants and the determinant of NN lead to necessary conditions for existence.The Bruck-Ryser-Chowla theorem gives a famous example of such ...
Haemers, W.H.
core +1 more source
More about Divisible Design Graphs [PDF]
: Divisible design graphs (DDG for short) have been recently defined by Kharaghani, Meulenberg and the second author as a generalization of (v, k, λ)-graphs.
Crnkovic, D., Haemers, W.H.
core +1 more source
Low dimensional strongly perfect lattices. I: The 12-dimensional case
, 2005 It is shown that the Coxeter-Todd lattice is the unique strongly perfect lattice in dimension ...
Nebe, Gabriele, Venkov, Boris
core +1 more source
On cyclic semiregular group divisible designs [PDF]
, 1986 Jimbo, Masakazu +2 more
core +2 more sources