The Dimension of the Code of a Strongly Resolvable Design

Abstract

This paper gives an explicit value for the dimension of the code of a strongly resolvable design over the field of prime order $p$ in the case when $p$ is not a divisor of $k-\rho$, where $k$ is the block size of the design and $\rho$ is the number of points in the intersection of two distinct blocks in the same resolution class.