Designs and their codes
On the classification of geometric codes by polynomial functions
Designs, Codes and Cryptography
The polynomial degree of the Grassmannian G(1,n,q) of lines in finite projective space PG(n, q)
Designs, Codes and Cryptography
| Hi-index | 0.00 |
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.