The rank of sparse random matrices over finite fields

Random Structures and Algorithms

Volumn 10, Issue 4, 1997, Pages 407-419

  Blömer, Johannes ^a,c   Karp, Richard ^b,c   Welzl, Emo ^a  

^a ETH ZURICH   (Switzerland)

^b University of Washington   (United States)

^c INTERNATIONAL COMPUTER SCIENCE INSTITUTE   (United States)

Author keywords

Finite fields; Random matrices; Rank

Indexed keywords

EID: 0040517363     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1098-2418(199707)10:4<407::AID-RSA1>3.0.CO;2-Y     Document Type: Article

References (9)

1. N. Alon and J. H. Spencer, The Probabilistic Method, Wiley, New York, 1992.
2. B. Bollobás, Random Graphs, Academic, New York, 1985.
3. N. J. Calkin, Dependent sets of constant weight vectors in GF[q], Random Struct. Alg., 9(1), 49-53 (1996).
4. W. Feller, An Introduction to Probability Theory and Its Applications, Wiley, New York, 1968.
5. D. J. Kelley and J. G. Oxley, On random representable matroids, Stud. Appl. Math., 71, 181-205 (1984).
6. V. F. Kolchin and V. I. Khokhlov, A threshold effect for systems of random equations of a special form, Discrete Math. Appl., 5(5), 425-436 (1995).
7. J. Kahn, J. Komlós, and E. Szemerédi, On the probability that a random ± 1-matrix is singular, J. Am. Math. Soc., 8(1), 223-240 (1995).
8. A. Mukhopadhyay, The probability that the determinant of an (n × n)-matrix over a finite field vanishes, Discrete Math., 51, 311-315 (1984).
9. R. P. Stanley, Enumerative Combinatorics, Wadsworth, Monterey, 1986.