Skip to main content
SpringerLink
Log in

On the Orthogonality of Geometric Codes

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

Abstract

We solve some problems concerning the orthogonality of geometric codes associated with sets of i- and j-dimensional subspaces of PG(n, q). Various applications are found, and we discuss all the interesting cases in small dimensional spaces.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. E. Assmus and J. D. Key, Designs and their Codes, Cambridge University Press, Cambridge (1993).

    Google Scholar 

  2. D. G. Glynn and J. W. P. Hirschfeld, On the classification of geometric codes by polynomial functions, Designs, Codes and Cryptography, Vol. 6 (1995) pp. 189-204.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. 3 St. Winifreds Place, Bryndwr, Christchurch, 8005, New Zealand

    David G. Glynn

Authors
  1. David G. Glynn
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Glynn, D.G. On the Orthogonality of Geometric Codes. Designs, Codes and Cryptography 31, 43–50 (2004). https://doi.org/10.1023/A:1027334503048

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1027334503048

Search

Navigation