Optimal Ferrers diagram rank-metric codes from MRD codes
From MaRDI portal
Publication:6070352
DOI10.1007/s10623-023-01284-8OpenAlexW4385999616MaRDI QIDQ6070352
Publication date: 20 November 2023
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-023-01284-8
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Combinatorial codes (94B25)
Cites Work
- Construction of subspace codes through linkage
- Linear subspaces of matrices associated to a Ferrers diagram and with a prescribed lower bound for their rank
- Theory of codes with maximum rank distance
- Bilinear forms over a finite field, with applications to coding theory
- Classifying optimal binary subspace codes of length 8, constant dimension 4 and minimum distance 6
- Constructions of optimal Ferrers diagram rank metric codes
- Several classes of optimal Ferrers diagram rank-metric codes
- Optimal Ferrers Diagram Rank-Metric Codes
- Subspace Codes Based on Graph Matchings, Ferrers Diagrams, and Pending Blocks
- Coding for Errors and Erasures in Random Network Coding
- A Rank-Metric Approach to Error Control in Random Network Coding
- Network information flow
- Coset Construction for Subspace Codes
- New Constant-Dimension Subspace Codes from Maximum Rank Distance Codes
- Generalized Linkage Construction for Constant-Dimension Codes
- Error-Correcting Codes in Projective Spaces Via Rank-Metric Codes and Ferrers Diagrams
- New Constructions of Subspace Codes Using Subsets of MRD Codes in Several Blocks
- Parallel Multilevel Constructions for Constant Dimension Codes
- Maximal Ferrers Diagram Codes: Constructions and Genericity Considerations
- Constructions for Optimal Ferrers Diagram Rank-Metric Codes
- New LMRD Code Bounds for Constant Dimension Codes and Improved Constructions
- Subspace codes from Ferrers diagrams
- Error-Correcting Codes in Projective Space
- Maximum-rank array codes and their application to crisscross error correction
- Constant dimension codes from multilevel construction based on matchings of complete hypergraphs
- Bilateral multilevel construction of constant dimension codes
- Constructions of optimal rank-metric codes from automorphisms of rational function fields
- Combining subspace codes
- Double Multilevel Constructions for Constant Dimension Codes
This page was built for publication: Optimal Ferrers diagram rank-metric codes from MRD codes
