Good Random Matrices over Finite Fields

Details Good Random Matrices over Finite Fields Good Random Matrices over Finite Fields

2010-08-19

arxiv.org/abs/1008.3408v4

Computer Science

Information Theory

25 pages, accepted for publication in Advances in Mathematics of Communications

Scientific paper

The random matrix uniformly distributed over the set of all m-by-n matrices over a finite field plays an important role in many branches of information theory. In this paper a generalization of this random matrix, called k-good random matrices, is studied. It is shown that a k-good random m-by-n matrix with a distribution of minimum support size is uniformly distributed over a maximum-rank-distance (MRD) code of minimum rank distance min{m,n}-k+1, and vice versa. Further examples of k-good random matrices are derived from homogeneous weights on matrix modules. Several applications of k-good random matrices are given, establishing links with some well-known combinatorial problems. Finally, the related combinatorial concept of a k-dense set of m-by-n matrices is studied, identifying such sets as blocking sets with respect to (m-k)-dimensional flats in a certain m-by-n matrix geometry and determining their minimum size in special cases.

Affiliated with

Also associated with

No associations

Rating

Good Random Matrices over Finite Fields does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Good Random Matrices over Finite Fields, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Good Random Matrices over Finite Fields will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-80225