Results 21 to 30 of about 36,156 (153)
Distance-regular Cayley graphs with small valency
, 2019 We consider the problem of which distance-regular graphs with small valency are Cayley graphs. We determine the distance-regular Cayley graphs with valency at most $4$, the Cayley graphs among the distance-regular graphs with known putative intersection ...
Jazaeri, Mojtaba, van Dam, Edwin R.
core +1 more source
Quasi-Hadamard Full Propelinear Codes [PDF]
, 2018 In this paper, we give a characterization of quasi-Hadamard groups in terms of propelinear codes. We define a new class of codes that we call quasi-Hadamard full propelinear codes.
Armario Sampalo, José Andrés +3 more
core +1 more source
Inequalities for Semiregular Group Divisible Designs
The Annals of Statistics, 1976 Let $s_{ju}$ be the number of varieties in common to the $j$th and $u$th blocks of a symmetric semiregular group divisible design. Connor (1952) and Saraf (1961) have given inequalities for $s_{ju}$. Both these inequalities lead to the same stronger inequality $\lambda_1 \leqq s_{ju} \leqq 2\lambda_2 - 1$.
openaire +2 more sources
Some construction of group divisible designs with singer groups
Discrete Mathematics, 1991 An MDS is a \((v,k,\lambda)\)-difference set with \(v=4(k-\lambda)\); then there exist an integer \(u\) such that \(v=4u^2\). A \((m,n,k,\lambda_1,\lambda_2)\)-DDS has the property \((M)\) if \(mn=4(k-\lambda_2)\). The case \(\lambda_1=0\) is characterized.
Arasu, K.T., Pott, Alexander
openaire +1 more source
HFR Code: A Flexible Replication Scheme for Cloud Storage Systems
, 2015 Fractional repetition (FR) codes are a family of repair-efficient storage codes that provide exact and uncoded node repair at the minimum bandwidth regenerating point.
Li, Hui +3 more
core +1 more source
Strongly regular graphs and group divisible designs [PDF]
Pacific Journal of Mathematics, 1974 0. Introduction. In the present paper, we use the counting techniques of the author's earlier work [5] to prove the converse of a result of R.C. Bose and S.S. Shrikhande [3] on geometric and pseudo-geometric graphs (q + l,q+H). Section 1 is devoted to preliminaries on strongly regular graphs and group divisible designs. We also give a brief description
openaire +3 more sources
The classification of flag-transitive Steiner 3-designs
, 2004 We solve the long-standing open problem of classifying all 3-(v,k,1) designs with a flag-transitive group of automorphisms (cf. A. Delandtsheer, Geom. Dedicata 41 (1992), p. 147; and in: "Handbook of Incidence Geometry", ed. by F.
Huber, Michael
core +1 more source
Le Matematiche, 1990 We prove that a set of v-2 symmetric idempotent latin squares of order v, such that no two of them agree in a off-diagonal position, exists for all odd v>>0.
Luc Teirlinck
doaj
A Generalization of Group Divisible Designs
The Annals of Mathematical Statistics, 1960 Roy [8] extended the idea of Group Divisible designs of Bose and Connor [1] to $m$-associate classes, calling such designs Hierarchical Group Divisible designs with $m$-associate classes. Subsequently, no literature is found in this direction. The purpose of this paper is to study these designs systematically.
openaire +3 more sources
FURTHER CONSTRUCTIONS OF NESTED GROUP DIVISIBLE DESIGNS
JOURNAL OF THE JAPAN STATISTICAL SOCIETY, 1996 Summary: Some methods of construction for nested group divisible designs are given. Cyclic nested group divisible designs are further discussed. Some individual plans are also tabulated with 4 new \(E\)-optimal designs.
Miao, Ying +2 more
openaire +3 more sources