Subspace codes from Ferrers diagrams
From MaRDI portal
Abstract: In this paper we give new constructions of Ferrer diagram rank metric codes, which achieve the largest possible dimension. In particular, we prove several cases of a conjecture by T. Etzion and N. Silberstein. We also establish a sharp lower bound on the dimension of linear rank metric anticodes with a given profile. Combining our results with the multilevel construction, we produce examples of subspace codes with the largest known cardinality for the given parameters.
Recommendations
- Constructions of optimal Ferrers diagram rank metric codes
- Several classes of optimal Ferrers diagram rank-metric codes
- Constructions of optimal rank-metric codes from automorphisms of rational function fields
- Subspace Codes
- New constant dimension subspace codes from parallel linkage construction and multilevel construction
Cites work
- A Random Linear Network Coding Approach to Multicast
- An algebraic approach for decoding spread codes
- Bilinear forms over a finite field, with applications to coding theory
- Codes and Designs Related to Lifted MRD Codes
- Coding for Errors and Erasures in Random Network Coding
- Construction of Large Constant Dimension Codes with a Prescribed Minimum Distance
- Error-Correcting Codes in Projective Space
- Error-Correcting Codes in Projective Spaces Via Rank-Metric Codes and Ferrers Diagrams
- Generalized weights: an anticode approach
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 1460605 (Why is no real title available?)
- scientific article; zbMATH DE number 3803604 (Why is no real title available?)
- Linear network coding
- Maximum-rank array codes and their application to crisscross error correction
- ON THE MAXIMAL RANK IN A SUBSPACE OF MATRICES
- Optimal Ferrers Diagram Rank-Metric Codes
- Partial spreads in random network coding
- Rank-metric codes and their duality theory
- Subspace Codes Based on Graph Matchings, Ferrers Diagrams, and Pending Blocks
- Subspaces of matrices with special rank properties
- Theory of codes with maximum rank distance
- Universal Gröbner bases for maximal minors
Cited in
(24)- Anticodes in the sum-rank metric
- Several classes of optimal Ferrers diagram rank-metric codes
- Improved generalized block inserting construction of constant dimension codes
- Subspace Codes
- Linear subspaces of matrices associated to a Ferrers diagram and with a prescribed lower bound for their rank
- A new construction of anticode-optimal Grassmannian codes
- Tensor representation of rank-metric codes
- Constant dimension codes from multilevel construction based on matchings of complete hypergraphs
- Almost affinely disjoint subspaces and covering Grassmannian codes
- Optimal Ferrers diagram rank-metric codes from MRD codes
- Generalized block inserting for constructing new constant dimension codes
- Bilateral multilevel construction of constant dimension codes
- Constructions of optimal rank-metric codes from automorphisms of rational function fields
- Rook Theory of the Etzion-Silberstein Conjecture
- New constant dimension subspace codes from multilevel linkage construction
- New constant dimension subspace codes from improved parallel subcode construction
- A proof of the Etzion-Silberstein conjecture for monotone and MDS-constructible Ferrers diagrams
- Generalized bilateral multilevel construction for constant dimension codes from parallel mixed dimension construction
- Multilevel inserting constructions for constant dimension subspace codes
- Blowup algebras of n-dimensional Ferrers diagrams
- Generalized bilateral multilevel construction for constant dimension codes
- Motzkin paths associated with flag codes
- A note on equidistant subspace codes
- Galois geometries and coding theory
This page was built for publication: Subspace codes from Ferrers diagrams
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5272572)
