On Codes of Bruck Nets and Projective Planes
نویسنده
چکیده
We summarize some recent results concerning codes of finite nets, which are of interest in the search for non-Desarguesian planes of prime order and certain composite orders. The p-ranks of 3-nets are determined by algebraic properties of the defining loops, and p-ranks of k-nets admitting certain abelian groups of translations are bounded by algebraic properties of the groups. Here we discuss the relationship between the p-ranks of two k-nets, and the p-rank of their direct product.
منابع مشابه
On Codes of Bruck Nets and Projective Planesg
We summarize some recent results concerning codes of nite nets, which are of interest in the search for non-Desarguesian planes of prime order and certain composite orders. The pranks of 3-nets are determined by algebraic properties of the deening loops, and pranks of k-nets admitting certain abelian groups of translations are bounded by algebraic properties of the groups. Here we discuss the r...
متن کاملBruck Nets and 2-Dimensional Codes
We introduce net codes, a class of (n, 2, d)q codes constructed using finite (Bruck) nets. We show linear codes to be precisely those net codes that may be constructed using Desarguesian nets. Consequently, we obtain some results on extending net codes, notably that linear codes of suitable length admit only linear extensions. We are also able to deduce that for certain values of q, nonlinear (...
متن کاملSubregular Spreads of Pg(2n + 1; Q)
In this paper, we develop some of the theory of spreads of projective spaces with an eye towards generalizing the results of Bruck 2]. In particular , we wish to generalize the notion of a subregular spread to the higher dimensional case. Most of the theory here was anticipated by Bruck in 3], 4], and 5]; however, he never provided a detailed formulation. We ll this gap here by developing the c...
متن کاملBruck Nets, Codes, and Characters of Loops
Numerous computational examples suggest that if Nk−1 ⊂ Nk are (k− 1)and k-nets of order n, then rankp Nk − rankp Nk−1 ≥ n − k + 1 for any prime p dividing n at most once. We conjecture that this inequality always holds. Using characters of loops, we verify the conjecture in case k = 3, proving in fact that if p ∣∣∣∣n, then rankpN3 ≥ 3n− 2− e, where equality holds if and only if the loop G coörd...
متن کاملProjective Planes, Coverings and a Network Problem
A problem concerning packet switched networks leads to a natural combinatorial design problem, whose solution involves (k; n)-arcs in projective planes, 3-dimensional linear codes, the theory of fractional matchings and designs which approximate projective planes.
متن کامل