Results 11 to 20 of about 15,144 (247)
Regular A-optimal Spring Balance Weighing Designs
Revstat Statistical Journal, 2012 The problem of indicating an A-optimal spring balance weighing design providing that the measurement errors have different variances and are uncorrelated is considered.
Małgorzata Graczyk
doaj +1 more source
Resolvable Group Divisible Designs with Large Groups
The Electronic Journal of Combinatorics, 2016 We prove that the necessary divisibility conditions are sufficient for the existence of resolvable group divisible designs with a fixed number of sufficiently large groups. Our method combines an application of the Rees product construction with a streamlined recursion based on incomplete transversal designs. With similar techniques, we also obtain new
Peter J. Dukes +2 more
openaire +2 more sources
Constructions of Sarvate-Beam Group Divisible Designs
Graphs and Combinatorics, 2022 A balanced incomplete block design is a set system in which all pairs of distinct elements occur with a constant frequency. By contrast, a Sarvate-Beam design induces an interval of distinct frequencies on pairs. In this paper, we settle the existence of a Sarvate-Beam variant of group divisible designs of uniform type with block size three.
Peter J. Dukes, Joanna Niezen
openaire +3 more sources
On the lengths of divisible codes [PDF]
, 2019 In this article, the effective lengths of all $q^r$-divisible linear codes over $\mathbb{F}_q$ with a non-negative integer $r$ are determined. For that purpose, the $S_q(r)$-adic expansion of an integer $n$ is introduced. It is shown that there exists a $
Kiermaier, Michael, Kurz, Sascha
core +3 more sources
On quasi-orthogonal cocycles [PDF]
, 2017 We introduce the notion of quasi-orthogonal cocycle. This is motivated in part by the maximal determinant problem for square {±1}-matrices of size congruent to 2 modulo 4. Quasi-orthogonal cocycles are analogous to the orthogonal cocycles of algebraic
Armario Sampalo, José Andrés +1 more
core +1 more source
Research on fractional repetition codes based on group divisible designs
Tongxin xuebao, 2015 A novel design of FR (fractional repetition) codes was proposed which aims at providing efficient repair at the minimum bandwidth regenerating point.The design consisted of an outer MDS (maximum distance separable) code and an inner repetition code ...
Bing ZHU +4 more
doaj +2 more sources
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
Nearly Optimal Sparse Group Testing
, 2018 Group testing is the process of pooling arbitrary subsets from a set of $n$ items so as to identify, with a minimal number of tests, a "small" subset of $d$ defective items.
Gandikota, Venkata +3 more
core +1 more source
Class-Uniformly Resolvable Group Divisible Structures I: Resolvable Group Divisible Designs [PDF]
The Electronic Journal of Combinatorics, 2004 We consider Class-Uniformly Resolvable Group Divisible Designs (CURGDD), which are resolvable group divisible designs in which each of the resolution classes has the same number of blocks of each size. We derive the fully general necessary conditions including a number of extremal bounds.
Peter Danziger, Brett Stevens
openaire +2 more sources
Group divisible designs with block size five [PDF]
Australas. J Comb., 2022 We report some group divisible designs with block size five, including types $6^{15}$ and $10^{15}$. As a consequence we are able to extend the known spectrum for 5-GDDs of type $g^u$.
openaire +3 more sources