How Much Does a Matrix of Rank k Weigh?
From MaRDI portal
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.
Recommendations
- On the rank of random matrix over prime field consisting of independent rows with given numbers of nonzero elements
- Possible numbers of nonzero entries in a matrix with a given term rank
- Possible numbers of ones in 0–1 matrices with a given rank
- Possible numbers of ones in the squares of 0–1 matrices with a given rank
- On the rank of random binary matrix with fixed weights of independent rows
Cited in
(5)- Structural attacks for public key cryptosystems based on Gabidulin codes
- A note on the distribution of weights of fixed-rank matrices over the binary field
- On the distribution of the entries of a fixed-rank random matrix over a finite field
- The central limit theorem for entries of random matrices with specified rank over finite fields
- On the dimension of the space generated by characteristic vectors of MRD codes
This page was built for publication: How Much Does a Matrix of Rank k Weigh?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5442651)