Weight and rank of matrices over finite fields
Theresa Migler, Kent E. Morrison, and Mitchell Ogle

TL;DR
This paper derives a formula for the average weight of matrices with a fixed rank over finite fields and provides a detailed analysis for rank-one matrices, including their weight distribution and a central limit theorem.
Contribution
It introduces a closed-form expression for the average weight of matrices of a given rank over finite fields and characterizes the weight distribution for rank-one matrices.
Findings
Closed-form formula for average weight of rank-k matrices
Complete weight distribution for rank-one matrices
Central limit theorem for rank-one matrix weights
Abstract
Define the weight of a matrix to be the number of non-zero entries. One would like to count by matrices over a finite field by their weight and rank. This is equivalent to determining the probability distribution of the weight while conditioning on the rank. The complete answer to this question is far from finished. As a step in that direction this paper finds a closed form for the average weight of an by matrix of rank over the finite field with elements. The formula is a simple algebraic expression in , , , and . For rank one matrices a complete description of the weight distribution is given and a central limit theorem is proved.
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 · Coding theory and cryptography · Graph theory and applications
