Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
Bruck nets, codes, and characters of loops
Moorhouse G. Designs, Codes and Cryptography1 (1):7-29,1991.Type:Article
Date Reviewed: Jul 1 1992

A k-net of order n is an incidence structure consisting of n2 points and nk distinguished subsets called lines, such that every line has exactly n points; parallelism is an equivalence relation on lines; k parallel classes exist, each consisting of n lines; and any two nonparallel lines meet exactly once. Moorhouse conjectures that if N k - 1 ⊂ N k are (k−1)- and k-nets of order n, then rank p N k - rank p N k - 1 ≥ n - k + 1 for any prime p dividing n at most once. The author establishes this conjecture for k = 3 using characters of loops and proves that if the conjecture is true, then any projective plane of order n ≡ 2 mod 4 or of squarefree order n is in fact desarguesian of prime order.

Reviewer:  P. K. Sahoo Review #: CR115693
Bookmark and Share
 
Coding And Information Theory (E.4 )
 
 
Numerical Linear Algebra (G.1.3 )
 
Would you recommend this review?
yes
no
Other reviews under "Coding And Information Theory": Date
A simple proof of the Delsarte inequalities
Simonis J., de Vroedt C. Designs, Codes and Cryptography 1(1): 77-82, 1991. Type: Article
Dec 1 1991
Diacritical analysis of systems
Oswald J., Ellis Horwood, Upper Saddle River, NJ, 1991. Type: Book (9780132087520)
Aug 1 1992
Coding and information theory
Roman S., Springer-Verlag New York, Inc., New York, NY, 1992. Type: Book (9780387978123)
Oct 1 1993
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy