Linear subspaces of matrices associated to a Ferrers diagram and with a prescribed lower bound for their rank
From MaRDI portal
Publication:490875
DOI10.1016/j.laa.2015.05.028zbMath1321.15033OpenAlexW577411133MaRDI QIDQ490875
Publication date: 21 August 2015
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2015.05.028
Other number fields (11R21) Finite fields (field-theoretic aspects) (12E20) Algebraic systems of matrices (15A30) Vector spaces, linear dependence, rank, lineability (15A03) Matrices, determinants in number theory (11C20)
Related Items (3)
Optimal Ferrers diagram rank-metric codes from MRD codes ⋮ Random matrices associated to Young diagrams ⋮ Several classes of optimal Ferrers diagram rank-metric codes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Subspaces of matrices with special rank properties
- Theory of codes with maximum rank distance
- Vector spaces of matrices of low rank
- On two extremal matrix problems
- Bilinear forms over a finite field, with applications to coding theory
- Invertible preservers and algebraic groups
- Optimal Ferrers Diagram Rank-Metric Codes
- Subspace Codes Based on Graph Matchings, Ferrers Diagrams, and Pending Blocks
- Algebraic Function Fields and Codes
- Coding for Errors and Erasures in Random Network Coding
- ON THE MAXIMAL RANK IN A SUBSPACE OF MATRICES
- LARGE SPACES OF MATRICES OF BOUNDED RANK
- Linear network coding
- Error-Correcting Codes in Projective Spaces Via Rank-Metric Codes and Ferrers Diagrams
- Subspace codes from Ferrers diagrams
- Maximum-rank array codes and their application to crisscross error correction
This page was built for publication: Linear subspaces of matrices associated to a Ferrers diagram and with a prescribed lower bound for their rank