On balanced difference packings
arXiv:2107.04790
Abstract
Let be a set of positive integers and let be an additive group. A difference packing is a set of subsets of with sizes from whose list of differences covers every element of at most once. It is balanced if the number of blocks of size does not depend on . In this paper, we determine a balanced difference packing of the largest possible size whenever is odd. The corresponding optimal balanced optical orthogonal signature pattern codes are also obtained.