Good random matrices over finite fields

DOI10.3934/AMC.2012.6.203zbMATH Open1278.94076arXiv1008.3408OpenAlexW1984049650MaRDI QIDQ444522FDOQ444522

Shengtian Yang, Thomas Honold

Publication date: 14 August 2012

Published in: Advances in Mathematics of Communications (Search for Journal in Brave)

Abstract: 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.

Full work available at URL: https://arxiv.org/abs/1008.3408

Recommendations

• Properties of sparse random matrices over finite fields
• On the genericity of maximum rank distance and Gabidulin codes
• The rank of sparse random matrices over finite fields
• Sparse parity-check matrices over finite fields (extended abstract)
• Random matrices and codes for the erasure channel

zbMATH Keywords

random matrixblocking sethomogeneous weightlinear codeaffine geometry of matricesdense set of matricesintersecting codemaximum-rank-distance codeMRD code

Mathematics Subject Classification ID

Random matrices (algebraic aspects) (15B52) Random matrices (probabilistic aspects) (60B20) Matrices over special rings (quaternions, finite fields, etc.) (15B33) Blocking sets, ovals, (k)-arcs (51E21) Linear codes (general theory) (94B05)

Cited In (6)

• Random Krylov Spaces over Finite Fields
• The homogeneous weight partition and its character-theoretic dual
• Algebraic structures of MRD codes
• Weight distribution of rank-metric codes
• Title not available (Why is that?)
• Properties of sparse random matrices over finite fields

This page was built for publication: Good random matrices over finite fields

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q444522)