Binary codes of odd-order nets

DOI10.1023/A:1008394218944MaRDI QIDQ1963173zbMATH OpenOpenAlexFDO

Authors Arthur A. Drisko, Edward F. jun. Assmus

Publication date 24 January 2000

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1008394218944

affine plane binary code Latin square net resolvable design

Combinatorial aspects of block designs (05B05) Orthogonal arrays, Latin squares, Room squares (05B15) Finite partial geometries (general), nets, partial spreads (51E14) Finite affine and projective planes (geometric aspects) (51E15) Linear codes (general theory) (94B05)

Review text

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.

Recommendations

Cited in

(7)

This page was built for publication: Binary codes of odd-order nets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1963173)