Constructions of optimal Ferrers diagram rank metric codes
From MaRDI portal
Publication:1755997
DOI10.1007/s10623-018-0491-4zbMath1402.94096OpenAlexW2954660273MaRDI QIDQ1755997
Publication date: 11 January 2019
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-018-0491-4
Related Items (6)
New constant dimension subspace codes from parallel linkage construction and multilevel construction ⋮ Constant dimension codes from multilevel construction based on matchings of complete hypergraphs ⋮ Optimal Ferrers diagram rank-metric codes from MRD codes ⋮ Bilateral multilevel construction of constant dimension codes ⋮ Constructions of optimal rank-metric codes from automorphisms of rational function fields ⋮ Several classes of optimal Ferrers diagram rank-metric codes
Cites Work
- Johnson type bounds on constant dimension codes
- Theory of codes with maximum rank distance
- Bilinear forms over a finite field, with applications to coding theory
- Bounds for projective codes from semidefinite programming
- Large constant dimension codes and lexicodes
- Optimal Ferrers Diagram Rank-Metric Codes
- Subspace Codes Based on Graph Matchings, Ferrers Diagrams, and Pending Blocks
- Codes and Designs Related to Lifted MRD Codes
- Coding for Errors and Erasures in Random Network Coding
- A Rank-Metric Approach to Error Control in Random Network Coding
- On Metrics for Error Correction in Network Coding
- Error-Correcting Codes in Projective Spaces Via Rank-Metric Codes and Ferrers Diagrams
- Recursive Code Construction for Random Networks
- Error-Correcting Codes in Projective Space
- Enumerative Coding for Grassmannian Space
- Constant-Rank Codes and Their Connection to Constant-Dimension Codes
- Construction of Large Constant Dimension Codes with a Prescribed Minimum Distance
This page was built for publication: Constructions of optimal Ferrers diagram rank metric codes
