Isometries for rank distance and permutation group of gabidulin codes
From MaRDI portal
Publication:3546563
DOI10.1109/TIT.2003.819322zbMath1285.94124OpenAlexW2140204181MaRDI QIDQ3546563
Publication date: 21 December 2008
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.2003.819322
Related Items (24)
Sum-rank product codes and bounds on the minimum distance ⋮ Rank error-correcting pairs ⋮ A new family of linear maximum rank distance codes ⋮ On self-dual MRD codes ⋮ Polynomial-time key recovery attack on the Faure-Loidreau scheme based on Gabidulin codes ⋮ Defining the \(q\)-analogue of a matroid ⋮ Linear cutting blocking sets and minimal codes in the rank metric ⋮ New criteria for MRD and Gabidulin codes and some rank-metric code constructions ⋮ Maximum scattered linear sets and MRD-codes ⋮ Constructions of optimal rank-metric codes from automorphisms of rational function fields ⋮ Hardness estimates of the code equivalence problem in the rank metric ⋮ Rank-metric codes and \(q\)-polymatroids ⋮ Extension of Overbeck's attack for Gabidulin-based cryptosystems ⋮ On the genericity of maximum rank distance and Gabidulin codes ⋮ Equivalence and characterizations of linear rank-metric codes based on invariants ⋮ On the security of a Loidreau rank metric code based encryption scheme ⋮ Linear codes using skew polynomials with automorphisms and derivations ⋮ MacWilliams extension theorems and the local-global property for codes over Frobenius rings ⋮ On defining generalized rank weights ⋮ Systematic encoders for generalized Gabidulin codes and the \(q\)-analogue of Cauchy matrices ⋮ Full Cryptanalysis of the Chen Identification Protocol ⋮ Theory of supports for linear codes endowed with the sum-rank metric ⋮ Hamming and simplex codes for the sum-rank metric ⋮ Rank-Metric Codes and Their Applications
This page was built for publication: Isometries for rank distance and permutation group of gabidulin codes
