Designs, Codes and Cryptography

, Volume 6, Issue 3, pp 189–204

On the classification of geometric codes by polynomial functions


  • D. G. Glynn
    • Department of Mathematics and StatisticsUniversity of Canterbury
  • J. W. P. Hirschfeld
    • School of Mathematical and Physical SciencesUniversity of Sussex

DOI: 10.1007/BF01388474

Cite this article as:
Glynn, D.G. & Hirschfeld, J.W.P. Des Codes Crypt (1995) 6: 189. doi:10.1007/BF01388474


It is shown how to represent algebraically all functions that have a zero sum on all μ-dimensional subspaces ofPG(n,q) or ofAG(n,q). In this way one can calculate the dimensions of related codes, or one can represent interesting sets of points by functions.


projectivefinite geometryovalovoidcodepolynomial function

Copyright information

© Kluwer Academic Publishers 1995