Non-linear maximum rank distance codes

From MaRDI portal
Publication:281322

DOI10.1007/s10623-015-0108-0zbMath1386.94112OpenAlexW2175076659MaRDI QIDQ281322

Francesco Pavese, Giuseppe Marino, Antonio Cossidente

Publication date: 10 May 2016

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-015-0108-0




Related Items (24)

Non-linear maximum rank distance codes in the cyclic model for the field reduction of finite geometriesSelf-duality of generalized twisted Gabidulin codesConstructions of rank metric codes under actions of the unitary groupsExceptional scattered polynomialsA new family of linear maximum rank distance codesOn the number of inequivalent Gabidulin codesMRD-codes arising from the trinomial \(x^q + x^{q^3} + c x^{q^5} \in \mathbb{F}_{q^6} [x\)] ⋮ On kernels and nuclei of rank metric codesNew criteria for MRD and Gabidulin codes and some rank-metric code constructionsOn absolute points of correlations of \(\mathrm{PG}(2,q^{n})\)Nuclei and automorphism groups of generalized twisted Gabidulin codesIdentifiers for MRD-codesNew semifields and new MRD codes from skew polynomial ringsOn the genericity of maximum rank distance and Gabidulin codesSome new non-additive maximum rank distance codesMatrix graphs and MRD codes over finite principal ideal ringsGeneralized bilinear forms graphs and MRD codes over a residue class ringA generalization of the normal rational curve in \(\mathrm {PG}(d,q^n)\) and its associated non-linear MRD codesGeneralized twisted Gabidulin codesOn the sparseness of certain linear MRD codesPuncturing maximum rank distance codesMRD codes with maximum idealizersAn asymptotically optimal construction of almost affinely disjoint subspacesBinary additive MRD codes with minimum distance \(n-1\) must contain a semifield spread set


Uses Software


Cites Work


This page was built for publication: Non-linear maximum rank distance codes