On dually almost MRD codes

DOI10.1016/J.FFA.2018.05.003MaRDI QIDQ1654489zbMATH OpenOpenAlexWikidataFDO

Authors Javier de la Cruz

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

zbMATH Keywords

MRD codes and dually AMRD codesrank defectrank metric codes

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Other types of codes (94B60)

Abstract: In this paper we define and study a family of codes which come close to be MRD codes, so we call them AMRD codes (almost MRD). An AMRD code is a code with rank defect equal to 1. AMRD codes whose duals are AMRD are called dually AMRD. Dually AMRD codes are the closest to the MRD codes given that both they and their dual codes are almost optimal. Necessary and sufficient conditions for the codes to be dually AMRD are given. Furthermore we show that dually AMRD codes and codes of rank defect one and maximum 2-generalized weight coincide when the size of the matrix divides the dimension.

Recommendations

• On self-dual MRD codes
• MRD codes: constructions and connections
• scientific article; zbMATH DE number 2154122
• Generalized twisted Gabidulin codes
• Identifiers for MRD-codes

Cites work

• A new family of linear maximum rank distance codes
• Algebraic structures of MRD codes
• Almost MDS codes
• Bilinear forms over a finite field, with applications to coding theory
• Codes of small defect
• Coding for Errors and Erasures in Random Network Coding
• Finite semifields
• Generalized Hamming weights for linear codes
• Generalized weights: an anticode approach
• On \(q\)-Steiner systems from rank metric codes
• On Metrics for Error Correction in Network Coding
• On self-dual MRD codes
• Rank-metric codes and their duality theory
• Relative Generalized Rank Weight of Linear Codes and Its Applications to Network Coding
• The Magma algebra system. I: The user language
• Theory of codes with maximum rank distance
• Universal Secure Network Coding via Rank-Metric Codes

Cited in

(9)

• On \(q\)-Steiner systems from rank metric codes
• Systematic maximum sum rank codes
• Rank-metric codes, generalized binomial moments and their zeta functions
• Partially scattered linearized polynomials and rank metric codes
• Duals of linearized Reed-Solomon codes
• Multi-orbit cyclic subspace codes and linear sets
• On self-dual MRD codes
• Evasive subspaces, generalized rank weights and near MRD codes
• On a family of linear MRD codes with parameters \([8\times 8,16,7]_q\)

Describes a project that uses

Uses Software

• Magma

This page was built for publication: On dually almost MRD codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1654489)