Theory of codes with maximum rank distance
From MaRDI portal
Publication:1071731
zbMath0585.94013MaRDI QIDQ1071731
Publication date: 1985
Published in: Problems of Information Transmission (Search for Journal in Brave)
Related Items (only showing first 100 items - show all)
Equivalence, group of automorphism and invariants of a family of rank metric codes arising from linearized polynomials ⋮ On the security of the modified dual-Ouroboros PKE using Gabidulin codes ⋮ Rank weights for arbitrary finite field extensions ⋮ 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 ⋮ Non-linear maximum rank distance codes ⋮ Rank-metric codes and their duality theory ⋮ 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 ⋮ Severely denting the Gabidulin version of the McEliece public key cryptosystem ⋮ Exceptional scattered polynomials ⋮ Skew and linearized Reed-Solomon codes and maximum sum rank distance codes over any division ring ⋮ A new family of linear maximum rank distance codes ⋮ Algebraic structures of MRD codes ⋮ Construction of subspace codes through linkage ⋮ Explicit constructions of some non-Gabidulin linear maximum rank distance codes ⋮ On self-dual MRD codes ⋮ Polynomial-time key recovery attack on the Faure-Loidreau scheme based on Gabidulin codes ⋮ Automorphism groups of Gabidulin-like codes ⋮ Rank metric codes and zeta functions ⋮ Generalized Gabidulin codes over fields of any characteristic ⋮ On the number of inequivalent Gabidulin codes ⋮ Authentication codes for nontrusting parties obtained from rank metric codes ⋮ On dually almost MRD codes ⋮ Defining the \(q\)-analogue of a matroid ⋮ On \(q\)-Steiner systems from rank metric codes ⋮ Rank subcodes in multicomponent network coding ⋮ Information security in a random network coding network ⋮ On the geometry of balls in the Grassmannian and list decoding of lifted Gabidulin codes ⋮ List and unique error-erasure decoding of interleaved Gabidulin codes with interpolation techniques ⋮ On transform-domain error and erasure correction by Gabidulin codes ⋮ Maximum scattered linear sets and MRD-codes ⋮ Fast decoding of Gabidulin codes ⋮ Constant rank-distance sets of Hermitian matrices and partial spreads in Hermitian polar spaces ⋮ Weight distribution of rank-metric codes ⋮ Generalized weights: an anticode approach ⋮ 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 ⋮ Galois geometries and coding theory ⋮ 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 ⋮ Erasure decoding for Gabidulin codes ⋮ Universal secure rank-metric coding schemes with optimal communication overheads ⋮ A characterization of linearized polynomials with maximum kernel ⋮ Linear subspaces of matrices associated to a Ferrers diagram and with a prescribed lower bound for their rank ⋮ Classification of large partial plane spreads in \(\mathrm{PG}(6,2)\) and related combinatorial objects ⋮ Low-rank matrix recovery using Gabidulin codes in characteristic zero ⋮ Anonymous coherent network coding against eavesdropping and jamming ⋮ A new faster algorithm for factoring skew polynomials over finite fields ⋮ Row reduction applied to decoding of rank-metric and subspace codes ⋮ Algebraic decoding of folded Gabidulin codes ⋮ 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 ⋮ On defining generalized rank weights ⋮ MRD-codes and linear sets ⋮ A generalization of the normal rational curve in \(\mathrm {PG}(d,q^n)\) and its associated non-linear MRD codes ⋮ Roos bound for skew cyclic codes in Hamming and rank metric ⋮ On the roots and minimum rank distance of skew cyclic codes ⋮ Designs as maximum codes in polynomial metric spaces ⋮ Constructions of optimal Ferrers diagram rank metric codes ⋮ Codes with the rank metric and matroids ⋮ On the reconstruction of linearized polynomials: a new decoding algorithm for Gabidulin codes. ⋮ Rank-metric complementary dual codes ⋮ Architecture-aware coding for distributed storage: repairable block failure resilient codes ⋮ Generalized twisted Gabidulin 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 ⋮ Coding with skew polynomial rings ⋮ On decoding additive generalized twisted Gabidulin codes ⋮ On deep holes of Gabidulin codes ⋮ On the list decodability of self-orthogonal rank-metric codes ⋮ Scattered subspaces and related codes ⋮ On maximum additive Hermitian rank-metric codes ⋮ 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 ⋮ Generalization of low rank parity-check (LRPC) codes over the ring of integers modulo a positive integer ⋮ Skew-cyclic codes ⋮ Column scrambler for the GPT cryptosystem ⋮ An algebraic attack on rank metric code-based cryptosystems ⋮ Decoding of random network codes ⋮ On (partial) unit memory codes based on Gabidulin codes ⋮ Extending Coggia-Couvreur attack on Loidreau's rank-metric cryptosystem ⋮ Bounds on the cardinality of subspace codes with non-maximum code distance ⋮ MRD codes with maximum idealizers ⋮ Cryptanalysis of a system based on twisted Reed-Solomon codes ⋮ A geometric approach to rank metric codes and a classification of constant weight codes ⋮ Wei-type duality theorems for rank metric codes ⋮ Hamming and simplex codes for the sum-rank metric ⋮ Construction of self-dual matrix codes
This page was built for publication: Theory of codes with maximum rank distance
