A formula for Glynn's hyperdeterminant detp (p prime) of a square matrix shows that the number of ways to decompose any integral doubly stochastic matrix with row and column sums p − 1 into p − 1 permutation matrices with even product, minus the number of ways with odd product, is 1 (mod p). It follows that the number of even Latin squares of order p − 1 is… (More)
There is polynomial function Xq in the entries of an m × m(q − 1) matrix over a field of prime characteristic p, where q = p h is a power of p, that has very similar properties to the determinant of a square matrix. It is invariant under multiplication on the left by a non-singular matrix, and under permutations of the columns. This gives a way to extend… (More)
In this article we count the number of [n, k] generalized Reed– Solomon (GRS) codes, including the codes coming from a non-degenerate conic plus nucleus. We compare our results with known formulae for the number of [n, 3] MDS codes with n = 6, 7, 8, 9.