Maximal Ferrers Diagram Codes: Constructions and Genericity Considerations

DOI10.1109/TIT.2019.2926256zbMath1432.94182arXiv1804.00624OpenAlexW2963761872WikidataQ127562346 ScholiaQ127562346MaRDI QIDQ5211440

Heide Gluesing-Luerssen, Jared Antrobus

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

Ferrers diagramconstruction of rankmetric codesmultilevel construction for subspace codes

Mathematics Subject Classification ID

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

Related Items

New constant dimension subspace codes from parallel linkage construction and multilevel construction ⋮ Density of free modules over finite chain rings ⋮ 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 ⋮ Bounds in the Lee metric and optimal codes ⋮ 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 ⋮ Rank-metric lattices

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