Enumeration of some particular 2N x 9 N-times persymmetric matrices overt F_2 by rank
Jorgen Cherly

TL;DR
This paper provides a count of specific 2n x 9n persymmetric matrices over F_2 based on their rank, offering insights into their enumeration.
Contribution
It introduces a method to enumerate particular 2n x 9n persymmetric matrices over F_2 by their rank, which was not previously detailed.
Findings
Derived formulas for counting matrices of each rank
Extended understanding of matrix structures over F_2
Potential applications in coding theory and combinatorics
Abstract
In this paper we count the number of some particular 2n x 9 n-times rank i matrices over F_2.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicsgraph theory and CDMA systems · Advanced Topics in Algebra · Graph theory and applications
