4 citations · 6 across the 9 of their papers we have counts for
10 papers
Colourings of Uniform Group Divisible Designs and Maximum Packings
Andrea C Burgess, Peter Danziger, Diane Donovan +4
A weak -colouring of a design is an assignment of colours to its points from a set of available colours, such that there are no monochromatic blocks. A colouring of a design…
Orthogonal cycle systems with cycle length less than 10
Selda Kucukcifci, E. Sule Yazici
An -decomposition of is a partition of the edge-set of into subsets, where each subset induces a copy of the graph . A -orthogonal -decomposition of a graph …
QC-LDPC Codes from Difference Matrices and Difference Covering Arrays
Diane Donovan, Asha Rao, Elif Üsküplü +1
We give a framework for generalizing LDPC code constructions that use Transversal Designs or related structures such as mutually orthogonal Latin squares. Our construction offers a…
Biembeddings of cycle systems using integer Heffter arrays
Nicholas J. Cavenagh, D. Donovan, E. Ş. Yazici
In this paper we will show the existence of a face -colourable biembedding of the complete graph onto an orientable surface where each face is a cycle of a fixed length , for…
The existence of square non-integer Heffter arrays
Nicholas J. Cavenagh, Jeff Dinitz, Diane Donovan +1
A Heffter array is an matrix such that each row and column contains filled cells, each row and column sum is divisible by and either or ap…
High Rate LDPC Codes from Difference Covering Arrays
D. Donovan, A. Rao, E. Şule Yazıcı
This paper presents a combinatorial construction of low-density parity-check (LDPC) codes from difference covering arrays. While the original construction by Gallagher was by rando…