Home Non-asymptotic bounds for probabilities of the rank of a random matrix over a finite field
Article
Licensed
Unlicensed Requires Authentication

Non-asymptotic bounds for probabilities of the rank of a random matrix over a finite field

  • A. N. Alekseychuk
Published/Copyright: June 28, 2007
Become an author with De Gruyter Brill
Discrete Mathematics and Applications
From the journal Volume 17 Issue 3

We consider a random (n + s) × n matrix A with independent rows over a field of q elements. In terms of the Fourier coefficients of distributions of the rows of this matrix we obtain expressions of upper and (in the case where the Fourier coefficients are non-negative quantities) lower bounds for probabilities of values of its rank. We find an upper bound for the distance in variation between the distributions of ranks of the matrix A and a random equiprobable matrix. We present a condition for this distance to tend to zero as and s is fixed and demonstrate that this condition, in some natural sense, cannot be weakened.

Published Online: 2007-06-28
Published in Print: 2007-07-20

Copyright 2007, Walter de Gruyter

Downloaded on 30.11.2025 from https://www.degruyterbrill.com/document/doi/10.1515/dma.2007.023/html
Scroll to top button