Skip to main content
Log in

On the p-rank of incidence matrices and a bound of Bruen and Ott

  • Published:
Designs, Codes and Cryptography Aims and scope Submit manuscript

Abstract

Bruen and Ott have derived an interesting lower bound on the p-rank of the incidence matrix of a partial linear space. We derive two extensions of their result.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. N.L. Biggs, Algebraic Graph Theory, Cambridge University Press, Cambridge (1974).

    Google Scholar 

  2. A.A. Bruen and U. Ott, On the p-rank of incidence matrices and a question of E.S. Lander, in : Finite Geometries and Combinatorial Designs, (eds. E.S. Kramer and S. Magliveras) American Math. Soc., (1990).

  3. G. Hillbrandt, The p-rank of 01-matrices, J. Combinatorial Theory, Series A Vol. 60 (1992) pp. 131–139.

    Google Scholar 

  4. E.S. Lander, Symmetric Designs: An Algebraic Approach, Cambridge University Press, Cambridge (1983).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

Communicated by R.C. Mullin

Rights and permissions

Reprints and permissions

About this article

Cite this article

De Caen, D., Godsil, C.D. & Royle, G.F. On the p-rank of incidence matrices and a bound of Bruen and Ott. Des Codes Crypt 2, 391–394 (1992). https://doi.org/10.1007/BF00125204

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00125204

Keywords