2015/01/12 by Rod Gow, Gow, Rod · 1 citation
Computer Science · Engineering · Mathematics · #15A03 #15B33 #Coding theory and cryptography #FOS: Mathematics #Finite Group Theory Research #Rings and Algebras (math.RA) #graph theory and CDMA systems #math.RA #msc:15A03 #msc:15B33
paper · pdf · doi:10.48550/arxiv.1501.02721
4 pages
arxiv created 2015/01/12 · openalex publication_date 2015/01/12 · arxiv updated 2015/01/13 · openalex created_date 2022/09/04 · openalex updated_date 2026/07/28
K be a field and let m and n be positive integers, where m does not exceed n. We say that a non-zero subspace of m x n matrices over K is a constant rank r subspace if each non-zero element of the subspace has rank r, where r is a positive integer that does not exceed m. We show in this paper that if K is a finite field containing at least r+1 elements, any constant rank r subspace of m x n matrices over K has dimension at most n.