Spreads in Projective Hjelmslev Spaces over Finite Chain Rings
نویسنده
چکیده
We prove a necessary and sufficient condition for the existence of spreads in the projective Hjelmslev geometries PHG Rn 1 R . Further, we give a construction of projective Hjelmslev planes from spreads that generalizes the familiar construction of projective planes from spreads in PG n q .
منابع مشابه
Optimal Arcs in Hjelmslev Spaces of Large Dimension
In this paper, we present various results on arcs in projective threedimensional Hjelmslev spaces over finite chain rings of nilpotency index 2. A table is given containing exact values and bounds for projective arcs in the geometries over the two chain rings with four elements.
متن کاملOn maximal arcs in projective Hjelmslev planes over chain rings of even characteristic
In this paper, we prove that maximal (k, 2)-arcs in projective Hjelmslev planes over chain rings R of nilpotency index 2 exist if and only if charR = 4. © 2005 Elsevier Inc. All rights reserved.
متن کاملLinear Codes over Finite Chain Rings
The aim of this paper is to develop a theory of linear codes over finite chain rings from a geometric viewpoint. Generalizing a well-known result for linear codes over fields, we prove that there exists a one-to-one correspondence between so-called fat linear codes over chain rings and multisets of points in projective Hjelmslev geometries, in the sense that semilinearly isomorphic codes corres...
متن کاملBlocking sets of Rédei type in projective Hjelmslev planes
The aim of this paper is to generalize the notion of a Rédei type blocking set to projective Hjelmslev planes. In what follows, we focus on Hjelmslev planes over chain rings of nilpotencey index 2, i.e. chain rings with rad R 6= (0) and (rad R)2 = (0). Thus we have always |R| = q2, where R/ rad R ∼= Fq. Chain rings with this property have been classified in [1, 6]. If q = pr there are exactly r...
متن کاملNew arcs in projective Hjelmslev planes over Galois rings
It is known that some good linear codes over a finite ring (R-linear codes) arise from interesting point constellations in certain projective geometries. For example, the expurgated Nordstrom-Robinson code, a nonlinear binary [14, 6, 6]-code which has higher minimum distance than any linear binary [14, 6]-code, can be constructed from a maximal 2-arc in the projective Hjelmslev plane over Z4. W...
متن کامل