Linear subspaces of matrices associated to a Ferrers diagram and with a prescribed lower bound for their rank
From MaRDI portal
(Redirected from Publication:490875)
Recommendations
Cites work
- scientific article; zbMATH DE number 3480719 (Why is no real title available?)
- scientific article; zbMATH DE number 1313469 (Why is no real title available?)
- scientific article; zbMATH DE number 3279238 (Why is no real title available?)
- Algebraic Function Fields and Codes
- Bilinear forms over a finite field, with applications to coding theory
- Coding for Errors and Erasures in Random Network Coding
- Error-Correcting Codes in Projective Spaces Via Rank-Metric Codes and Ferrers Diagrams
- Invertible preservers and algebraic groups
- LARGE SPACES OF MATRICES OF BOUNDED RANK
- Linear network coding
- Maximum-rank array codes and their application to crisscross error correction
- ON THE MAXIMAL RANK IN A SUBSPACE OF MATRICES
- On two extremal matrix problems
- Optimal Ferrers Diagram Rank-Metric Codes
- Subspace Codes Based on Graph Matchings, Ferrers Diagrams, and Pending Blocks
- Subspace codes from Ferrers diagrams
- Subspaces of matrices with special rank properties
- Theory of codes with maximum rank distance
- Vector spaces of matrices of low rank
Cited in
(5)- Several classes of optimal Ferrers diagram rank-metric codes
- A proof of the Etzion-Silberstein conjecture for monotone and MDS-constructible Ferrers diagrams
- Optimal Ferrers diagram rank-metric codes from MRD codes
- A determinantal version of the frobenius-könig theorem
- Random matrices associated to Young diagrams
This page was built for publication: Linear subspaces of matrices associated to a Ferrers diagram and with a prescribed lower bound for their rank
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q490875)