Nets and their codes
From author's abstract: ``In this paper finite nets [cfr. \textit{R. H. Bruck}, Pac. J. Math. 13, 421-457 (1963; Zbl 0124.009)] will be studied using the following linear codes: the row space of the incidence vectors of lines, the intersection of this code with its orthogonal, the code generated by differences of parallel lines, and the orthogonal to these codes. Using these codes we are able to recast the \textit{G. E. Moorhouse} conjecture [cfr. Des. Codes Cryptography 1, No. 1, 7-29 (1991; Zbl 0755.05020)] in terms of subcodes of the codes he uses, determine coding- theoretic reasons for a net's being maximal, and generalize a theorem of Assmus and Key which uses codes to classify finite planes of prime order.'' In the references read [7] instead of [12] and [8] instead of [13].
scientific article; zbMATH DE number 474716