Several classes of optimal Ferrers diagram rank-metric codes

DOI10.1016/J.LAA.2019.07.011MaRDI QIDQ2273871zbMATH OpenOpenAlexFDO

Authors Shuangqing Liu, Tao Feng, Yanxun Chang

Publication date 18 September 2019

Published in Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1809.00996

zbMATH Keywords

constant dimension codeFerrers diagramgabidulin coderank-metric code

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Combinatorial codes (94B25)

Abstract: Four constructions for Ferrers diagram rank-metric (FDRM) codes are presented. The first one makes use of a characterization on generator matrices of a class of systematic maximum rank distance codes. By introducing restricted Gabidulin codes, the second construction is presented, which unifies many known constructions for FDRM codes. The third and fourth constructions are based on two different ways to represent elements of a finite field $mathbb{F}_{q^m}$ (vector representation and matrix representation). Each of these constructions produces optimal codes with different diagrams and parameters.

Recommendations

• Constructions of optimal Ferrers diagram rank metric codes
• Constructions of optimal rank-metric codes from automorphisms of rational function fields
• Subspace codes from Ferrers diagrams
• A new construction of anticode-optimal Grassmannian codes
• MRD codes: constructions and connections

Cites work

• A Rank-Metric Approach to Error Control in Random Network Coding
• Additive Rank Metric 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
• Constant-Rank Codes and Their Connection to Constant-Dimension Codes
• Construction of Large Constant Dimension Codes with a Prescribed Minimum Distance
• Constructions for Optimal Ferrers Diagram Rank-Metric Codes
• Constructions of optimal Ferrers diagram rank metric codes
• Cyclic Orbit Codes
• Enumerative Coding for Grassmannian Space
• Error-Correcting Codes in Projective Space
• Error-Correcting Codes in Projective Spaces Via Rank-Metric Codes and Ferrers Diagrams
• Large constant dimension codes and lexicodes
• Linear subspaces of matrices associated to a Ferrers diagram and with a prescribed lower bound for their rank
• Maximal Ferrers Diagram Codes: Constructions and Genericity Considerations
• Maximum-rank array codes and their application to crisscross error correction
• Optimal Ferrers Diagram Rank-Metric Codes
• Recursive Code Construction for Random Networks
• Subspace Codes Based on Graph Matchings, Ferrers Diagrams, and Pending Blocks
• Subspace codes from Ferrers diagrams
• Theory of codes with maximum rank distance

Cited in

(11)

• Constructions of optimal Ferrers diagram rank metric codes
• New constant dimension subspace codes from parallel linkage construction and multilevel construction
• A new construction of anticode-optimal Grassmannian codes
• Subspace codes from Ferrers diagrams
• 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
• A proof of the Etzion-Silberstein conjecture for monotone and MDS-constructible Ferrers diagrams
• Multilevel inserting constructions for constant dimension subspace codes
• Generalized bilateral multilevel construction for constant dimension codes

This page was built for publication: Several classes of optimal Ferrers diagram rank-metric codes

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