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].
- Affine and projective planes
- Bruck nets, codes, and characters of loops
- Finite Nets, I. Numerical Invariants
- Finite nets. II: Uniqueness and imbedding
- scientific article; zbMATH DE number 3790437 (Why is no real title available?)
- Nets and their codes
- On the construction of finite projective planes from homology semibiplanes
- Bruck nets, codes, and characters of loops
- Nets and their codes
- A coding theoretic solution to the 36 officer problem
- On the \(p\)-ranks of net graphs
- Binary codes of odd-order nets
- Two applications of nets
- The code of the symmetric net with \(m\) = 4 and \(\mu = 2\)
- Codes of nets and projective planes
- scientific article; zbMATH DE number 4214819 (Why is no real title available?)
- Ranks of nets
- Bruck nets and 2-dimensional codes
- scientific article; zbMATH DE number 1382055 (Why is no real title available?)
- Embedding symmetric nets in affine geometry and Reed-Muller codes
- Codes for the World Wide Web
- On cyclic and negacyclic codes with one-dimensional hulls and their applications
- The number of codes over rings of order 4 containing a hull of given type
- Dihedral codes with 1-dimensional hulls and 1-dimensional linear complementary pairs of dihedral codes
- The neighbor graph of binary self-orthogonal codes
This page was built for publication: Nets and their codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1309826)