Enumerating the uniform switching system by k-sets
The uniform switching system is the family of non-linear n x m binary arrays constrained such that all columns are from the constant weight k vectors and all rows have weights divisible by p > 0. For this system, we present a cardinality formula and an enumerative algorithm.
uniform switching system k-sets enumerative algorithm generalized krawtchouk polynomials non-linear two-dimensional array