Results 11 to 20 of about 36,156 (153)
$q$-analogs of group divisible designs [PDF]
, 2018 18 pages, 3 tables, typos ...
Buratti, Marco +4 more
openaire +5 more sources
Generalized binary arrays from quasi-orthogonal cocycles [PDF]
, 2020 Generalized perfect binary arrays (GPBAs) were used by Jedwab to construct perfect binary arrays. A non-trivial GPBA can exist only if its energy is 2 or a multiple of 4. This paper introduces generalized optimal binary arrays (GOBAs) with even energy
Armario Sampalo, José Andrés +1 more
core +2 more sources
Semifields, relative difference sets, and bent functions [PDF]
, 2014 Recently, the interest in semifields has increased due to the discovery of several new families and progress in the classification problem. Commutative semifields play an important role since they are equivalent to certain planar functions (in the case ...
Pott, Alexander +2 more
core +2 more sources
Group Divisible Codes and Their Application in the Construction of Optimal Constant-Composition Codes of Weight Three [PDF]
, 2008 The concept of group divisible codes, a generalization of group divisible designs with constant block size, is introduced in this paper. This new class of codes is shown to be useful in recursive constructions for constant-weight and constant-composition
Chee, Yeow Meng +2 more
core +1 more source
Spectrum of Sizes for Perfect Deletion-Correcting Codes [PDF]
, 2010 One peculiarity with deletion-correcting codes is that perfect $t$-deletion-correcting codes of the same length over the same alphabet can have different numbers of codewords, because the balls of radius $t$ with respect to the Levenshte\u{\i}n distance ...
Alan C. H. Ling +15 more
core +1 more source
Collusion Attack Resilient 3D Mesh Watermarking Based on Anti-Collusion Fingerprint Code
Applied Sciences, 2018 Collusion attack is one of the techniques used for unauthorized removal of embedded marks. However, there are no algorithms that utilize the averaging-resilient fingerprint code into 3D mesh watermarking.
Jong-Uk Hou, In-Jae Yu, Heung-Kyu Lee
doaj +1 more source
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
Generalized Log-Normal Chain-Ladder
, 2018 We propose an asymptotic theory for distribution forecasting from the log normal chain-ladder model. The theory overcomes the difficulty of convoluting log normal variables and takes estimation error into account. The results differ from that of the over-
B. Nielsen +6 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
On group divisible covering designs
Discrete Mathematics, 1999 The notion of group divisible covering design (GDCD) is introduced. The number of blocks in a minimum GDCD with block size \(k\) and group-type \(g^u\), is the covering number \( C(k,g^u)\), whose values are determined for all positive integers \(g\) and \(u\geq 3\).
Heinrich, Katherine, Yin, Jianxing
openaire +1 more source