13. MRD codes: constructions and connections

From MaRDI portal
Publication:3299919

DOI10.1515/9783110642094-013zbMath1465.94116arXiv1904.05813OpenAlexW4205456245MaRDI QIDQ3299919

John Sheekey

Publication date: 27 July 2020

Published in: Combinatorics and Finite Fields (Search for Journal in Brave)

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




Related Items (29)

\(r\)-fat linearized polynomials over finite fieldsEquivalence, group of automorphism and invariants of a family of rank metric codes arising from linearized polynomialsExtending two families of maximum rank distance codesFurther results on LCD generalized Gabidulin codesNon-minimum tensor rank Gabidulin codesTwisted linearized Reed-Solomon codes: a skew polynomial frameworkLinear sets from projection of Desarguesian spreadsCones from maximum \(h\)-scattered linear sets and a stability result for cylinders from hyperovalsRank-Metric Codes, Semifields, and the Average Critical ProblemThe interplay of different metrics for the construction of constant dimension codesConstructions of optimal rank-metric codes from automorphisms of rational function fieldsCombining subspace codesVector space partitions of GF(2)^8On certain linearized polynomials with high degree and kernel of small dimensionEquivalence and characterizations of linear rank-metric codes based on invariantsMatrix graphs and MRD codes over finite principal ideal ringsMulti-orbit cyclic subspace codes and linear setsExceptional scatteredness in prime degreeNew constructions of constant dimension codes by improved inserting constructionLinearized trinomials with maximum kernelOn a conjecture about maximum scattered subspaces of \(\mathbb{F}_{q^6}\times\mathbb{F}_{q^6}\)On decoding additive generalized twisted Gabidulin codesOn \(q\)-covering designsRank-metric codes, linear sets, and their dualityOn the sparseness of certain linear MRD codesOn symmetric and Hermitian rank distance codesAn asymptotically optimal construction of almost affinely disjoint subspacesRank-Metric Codes and Their ApplicationsAn exponential bound on the number of non-isotopic commutative semifields




This page was built for publication: 13. MRD codes: constructions and connections