Finite Nets, I. Numerical Invariants
From MaRDI portal
Publication:5804608
DOI10.4153/CJM-1951-012-7zbMath0042.38802MaRDI QIDQ5804608
Publication date: 1951
Published in: Canadian Journal of Mathematics (Search for Journal in Brave)
Related Items
Nets and generalized quadrangles ⋮ Orthomorphisms of \(Z_ p\) ⋮ Numerical invariants of strongly regular graphs ⋮ Harmonious groups ⋮ Homomorphisms of nets of fixed degree, with singular points on the same line ⋮ Strongly regular configurations ⋮ Partial spreads over \({\mathbb{Z}}_ q\) ⋮ Existence results for translation nets. II ⋮ Duality in coherent configurations ⋮ Algebraic representation of affine MDS-codes and mutually orthogonal Latin squares ⋮ Unnamed Item ⋮ A characterization of 3-nets ⋮ Enumeration of sets of mutually orthogonal Latin rectangles ⋮ Transversal designs associated with Frobenius groups ⋮ A Cartesian product construction for unconditionally secure authentication codes that permit arbitration ⋮ Incidence structures whose planes are nets ⋮ Classification of highly symmetrical translation loops of order \(2p\), \(p\) prime. ⋮ Weighted arcs, the finite Radon transform and a Ramsey problem ⋮ The Paulus–Rozenfeld–Thompson Graph on 26 Vertices Revisited and Related Combinatorial Structures ⋮ Bruck nets, codes, and characters of loops ⋮ Maximal sets of mutually orthogonal Latin squares. I ⋮ Linear representations of subgeometries ⋮ Translation nets: A survey ⋮ Maximal partial spreads and transversal-free translation nets ⋮ A combinatorial problem with applications to geometry ⋮ Finite nets of dimension three. I ⋮ (6,3)-MDS codes over an alphabet of size 4 ⋮ Finite Klingenberg planes ⋮ Partial geometry of dimension three ⋮ On ovoids of the generalized quadrangle \(H(3,q^2)\) ⋮ Maximal sets of Latin squares and partial transversals ⋮ О методах построения систем ортогональных квазигрупп с использованием групп ⋮ Sesqui-arrays, a generalisation of triple arrays ⋮ Unnamed Item ⋮ Constructions for resolvable and related designs ⋮ Transversal-free nets of small deficiency ⋮ Message Authentication with Arbitration of Transmitter/Receiver Disputes ⋮ Optimality of partial geometric designs ⋮ Nets and their codes ⋮ Maximal difference matrices of order \(\leq 10\) ⋮ A coding theoretic solution to the 36 officer problem
