Maximal Ferrers Diagram Codes: Constructions and Genericity Considerations

DOI10.1109/TIT.2019.2926256MaRDI QIDQ5211440zbMATH OpenOpenAlexWikidataFDO

Authors Jared Antrobus, Heide Gluesing-Luerssen

Publication date 28 January 2020

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

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

zbMATH Keywords

construction of rankmetric codesFerrers diagrammultilevel construction for subspace codes

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cyclic codes (94B15)

Abstract: This paper investigates the construction of rank-metric codes with specified Ferrers diagram shapes. These codes play a role in the multilevel construction for subspace codes. A conjecture from 2009 provides an upper bound for the dimension of a rank-metric code with given specified Ferrers diagram shape and rank distance. While the conjecture in its generality is wide open, several cases have been established in the literature. This paper contributes further cases of Ferrers diagrams and ranks for which the conjecture holds true. In addition, the proportion of maximal Ferrers diagram codes within the space of all rank-metric codes with the same shape and dimension is investigated. Special attention is being paid to MRD codes. It is shown that for growing field size the limiting proportion depends highly on the Ferrers diagram. For instance, for $[mimes2]$-MRD codes with rank~$2$ this limiting proportion is close to $1/e$.

Cited in

(27)

• Construction of a family of finite maximal codes
• Constructions of optimal Ferrers diagram rank metric codes
• Rank-metric lattices
• New constant dimension subspace codes from parallel linkage construction and multilevel construction
• Density of free modules over finite chain rings
• Several classes of optimal Ferrers diagram rank-metric codes
• Partition-balanced families of codes and asymptotic enumeration in coding theory
• On the sparseness of certain linear MRD codes
• Bounds in the Lee metric and optimal codes
• Common Complements of Linear Subspaces and the Sparseness of MRD Codes
• Constant dimension codes from multilevel construction based on matchings of complete hypergraphs
• Construction of constant dimension codes via improved inserting construction
• Optimal Ferrers diagram rank-metric codes from MRD codes
• Rank-Metric Codes, Semifields, and the Average Critical Problem
• Bilateral multilevel construction of constant dimension codes
• The interplay of different metrics for the construction of constant dimension codes
• Constructions of optimal rank-metric codes from automorphisms of rational function fields
• Densities of codes of various linearity degrees in translation-invariant metric spaces
• A proof of the Etzion-Silberstein conjecture for monotone and MDS-constructible Ferrers diagrams
• Maximum weight codewords of a linear rank-metric code
• Generalized bilateral multilevel construction for constant dimension codes from parallel mixed dimension construction
• Multilevel inserting constructions for constant dimension subspace codes
• Whitney numbers of rank-metric lattices and code enumeration
• Valued rank-metric codes
• Generalized bilateral multilevel construction for constant dimension codes
• Better bounds on the minimum Lee distance
• Multilevel constructions of constant dimension codes based on one-factorization of complete graphs

This page was built for publication: Maximal Ferrers Diagram Codes: Constructions and Genericity Considerations

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