Binary codes of odd-order nets (Q1963173)

An \(r\)-net of order \(q\) can be viewed as an affine resolvable 1-design with \(r\) parallel classes each consisting of \(q\) blocks of size \(q\) such that every two non-parallel blocks intersect in a unique point. The binary code of an \(r\)-net is the code over \(F_2^{q^2}\) generated by the (incidence vectors of the) blocks. A wide variety of results regarding the binary codes of odd-order \(r\)-nets are discussed. For example, if the code contains odd-weight vectors of weight less than \(q\), then the \(r\)-net cannot be extended to an \((r+1)\)-net. Many of the results are closely related to those of \textit{P. Delsarte} [Inform. Control 19, 319-325 (1971; Zbl 0221.94017)]. Latin squares, which produce 3-nets, and their codes are considered. Nets of order at most 9 that complete to an affine plane are discussed. Some of the results are generalized to the case of affine resolvable 2-designs. The paper ends with a list of central open questions.