Theory of codes with maximum rank distance
From MaRDI portal
This paper introduces a new metric, called the ``rank metric. For this metric, a theory of codes over \(\mathrm{GF}(q^N)\) analogous to the theory of MBD codes is formulated. The studies presented include codes with maximum rank distance, their spectrum, and encoding and decoding algorithms. Analogous to ``generalized Reed-Solomon codes an extensive class of MRD codes (maximum rank distance codes) are described.
Recommendations
Cited in
(only showing first 100 items - show all)- Probabilistic algorithm for finding roots of linearized polynomials
- Attacks and counter-attacks on the GPT public key cryptosystem
- Error and erasure correcting algorithms for rank codes
- Skew codes of prescribed distance or rank
- Skew-cyclic codes
- Designs as maximum codes in polynomial metric spaces
- Self-duality of generalized twisted Gabidulin codes
- Efficient decoding of interleaved subspace and Gabidulin codes beyond their unique decoding radius using Gröbner bases
- Binary subspace codes in small ambient spaces
- Design of \(\mathcal{T}\)-\textit{direct} codes over \(\mathrm{GF}(2^N)\) with increased users
- Fast operations on linearized polynomials and their applications in coding theory
- Exceptional scattered polynomials
- Skew and linearized Reed-Solomon codes and maximum sum rank distance codes over any division ring
- Polynomial-time key recovery attack on the Faure-Loidreau scheme based on Gabidulin codes
- Rank metric codes and zeta functions
- Generalized Gabidulin codes over fields of any characteristic
- On the number of inequivalent Gabidulin codes
- On dually almost MRD codes
- Defining the \(q\)-analogue of a matroid
- On \(q\)-Steiner systems from rank metric codes
- Maximum scattered linear sets and MRD-codes
- Weight distribution of rank-metric codes
- Concatenation of convolutional codes and rank metric codes for multi-shot network coding
- Extension of Overbeck's attack for Gabidulin-based cryptosystems
- On the genericity of maximum rank distance and Gabidulin codes
- Hartmann-Tzeng bound and skew cyclic codes of designed Hamming distance
- Some new non-additive maximum rank distance codes
- A new hybrid coding scheme: homomorphic minimum bandwidth repairing codes
- Construction of high rate \(\mathcal {T}\)-direct codes
- On circulant involutory MDS matrices
- Classifying optimal binary subspace codes of length 8, constant dimension 4 and minimum distance 6
- Improved syndrome decoding of lifted L-interleaved Gabidulin codes
- Evaluation and interpolation over multivariate skew polynomial rings
- Universal secure rank-metric coding schemes with optimal communication overheads
- A characterization of linearized polynomials with maximum kernel
- Low-rank matrix recovery using Gabidulin codes in characteristic zero
- Anonymous coherent network coding against eavesdropping and jamming
- Classes and equivalence of linear sets in \(\mathrm{PG}(1,q^{n})\)
- Generalized bilinear forms graphs and MRD codes over a residue class ring
- A new family of MRD-codes
- A generalization of the normal rational curve in \(\mathrm {PG}(d,q^n)\) and its associated non-linear MRD codes
- Constructions of optimal Ferrers diagram rank metric codes
- On the reconstruction of linearized polynomials: a new decoding algorithm for Gabidulin codes.
- Architecture-aware coding for distributed storage: repairable block failure resilient codes
- On deep holes of Gabidulin codes
- On the list decodability of self-orthogonal rank-metric codes
- Column scrambler for the GPT cryptosystem
- Maximum distance codes in Mat\(_{n,s}(\mathbb Z_k)\) with a non-Hamming metric and uniform distributions
- Severely denting the Gabidulin version of the McEliece public key cryptosystem
- Authentication codes for nontrusting parties obtained from rank metric codes
- Fast decoding of Gabidulin codes
- Roos bound for skew cyclic codes in Hamming and rank metric
- Codes with the rank metric and matroids
- Rank-metric complementary dual codes
- A modified Dual-Ouroboros public-key encryption using Gabidulin codes
- LIGA: a cryptosystem based on the hardness of rank-metric list and interleaved decoding
- On decoding additive generalized twisted Gabidulin codes
- Scattered subspaces and related codes
- On maximum additive Hermitian rank-metric codes
- Generalization of low rank parity-check (LRPC) codes over the ring of integers modulo a positive integer
- An algebraic attack on rank metric code-based cryptosystems
- Extending Coggia-Couvreur attack on Loidreau's rank-metric cryptosystem
- Bounds on the cardinality of subspace codes with non-maximum code distance
- Application of \(\mathcal{T}\)-direct codes in multiple-rate codes
- An asymptotically optimal construction of almost affinely disjoint subspaces
- q-polymatroids and their relation to rank-metric codes
- Encoding and decoding of several optimal rank metric codes
- Parallel sub-code construction for constant-dimension codes
- A gapless code-based hash proof system based on RQC and its applications
- On the list decodability of rank-metric codes containing Gabidulin codes
- Multiple-rate error-correcting coding scheme
- New constant dimension subspace codes from block inserting constructions
- New constant dimension subspace codes from parallel linkage construction and multilevel construction
- Constructions of rank metric codes under actions of the unitary groups
- Extending two families of maximum rank distance codes
- Further results on LCD generalized Gabidulin codes
- 50 years of translation structures
- Non-minimum tensor rank Gabidulin codes
- A practicable timing attack against HQC and its countermeasure
- The rank-based cryptography library
- Twisted linearized Reed-Solomon codes: a skew polynomial framework
- Linear cutting blocking sets and minimal codes in the rank metric
- MRD-codes arising from the trinomial \(x^q + x^{q^3} + c x^{q^5} \in \mathbb{F}_{q^6} [x]\)
- On equivalence of maximum additive symmetric rank-distance codes
- Automorphism groups and new constructions of maximum additive rank metric codes with restrictions
- Systematic maximum sum rank codes
- Classification of multivariate skew polynomial rings over finite fields via affine transformations of variables
- Rank-metric codes and \(q\)-polymatroids
- Equivalence and characterizations of linear rank-metric codes based on invariants
- Rank-metric codes, generalized binomial moments and their zeta functions
- Matrix graphs and MRD codes over finite principal ideal rings
- Linearized decomposition codes and finite integer set coverings
- Partitions of matrix spaces with an application to \(q\)-rook polynomials
- Subspace packings: constructions and bounds
- On the security of a Loidreau rank metric code based encryption scheme
- Abelian non-cyclic orbit codes and multishot subspace codes
- A polymatroid approach to generalized weights of rank metric codes
- A new rank metric for convolutional codes
- Low-rank parity-check codes over Galois rings
- Classical misuse attacks on NIST round 2 PQC. The power of rank-based schemes
This page was built for publication: Theory of codes with maximum rank distance
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1071731)
