On dually almost MRD codes
From MaRDI portal
Publication:1654489
DOI10.1016/j.ffa.2018.05.003zbMath1393.94961arXiv1612.04268OpenAlexW2565946650WikidataQ129429155 ScholiaQ129429155MaRDI QIDQ1654489
Publication date: 8 August 2018
Published in: Finite Fields and their Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1612.04268
Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Other types of codes (94B60)
Related Items
On \(q\)-Steiner systems from rank metric codes, Evasive subspaces, generalized rank weights and near MRD codes, Systematic maximum sum rank codes, On a family of linear MRD codes with parameters \([8\times 8,16,7_q\)], Rank-metric codes, generalized binomial moments and their zeta functions, Multi-orbit cyclic subspace codes and linear sets, Partially scattered linearized polynomials and rank metric codes
Uses Software
Cites Work
- Unnamed Item
- Rank-metric codes and their duality theory
- A new family of linear maximum rank distance codes
- Algebraic structures of MRD codes
- On self-dual MRD codes
- Codes of small defect
- Almost MDS codes
- Generalized weights: an anticode approach
- Theory of codes with maximum rank distance
- Bilinear forms over a finite field, with applications to coding theory
- The Magma algebra system. I: The user language
- On \(q\)-Steiner systems from rank metric codes
- Relative Generalized Rank Weight of Linear Codes and Its Applications to Network Coding
- Coding for Errors and Erasures in Random Network Coding
- Generalized Hamming weights for linear codes
- On Metrics for Error Correction in Network Coding
- Universal Secure Network Coding via Rank-Metric Codes
