Systematic encoders for generalized Gabidulin codes and the \(q\)-analogue of Cauchy matrices
From MaRDI portal
Publication:2310392
DOI10.1016/j.laa.2020.02.002zbMath1434.94089arXiv1805.06706OpenAlexW3004520120MaRDI QIDQ2310392
Publication date: 6 April 2020
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1805.06706
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05)
Related Items (8)
Extending two families of maximum rank distance codes ⋮ Identifiers for MRD-codes ⋮ Systematic maximum sum rank codes ⋮ Equivalence and characterizations of linear rank-metric codes based on invariants ⋮ Vertex properties of maximum scattered linear sets of \(\mathrm{PG} ( 1 , q^n )\) ⋮ Rank-Metric Codes Over Arbitrary Galois Extensions and Rank Analogues of Reed--Muller Codes ⋮ Rank-Metric Codes and Their Applications ⋮ Codes in the Sum-Rank Metric: Fundamentals and Applications
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new family of linear maximum rank distance codes
- Generalized twisted Gabidulin codes
- Theory of codes with maximum rank distance
- The automorphism groups of Reed-Solomon codes
- Bilinear forms over a finite field, with applications to coding theory
- Generalized Gabidulin codes over fields of any characteristic
- On the genericity of maximum rank distance and Gabidulin codes
- Low-rank matrix recovery using Gabidulin codes in characteristic zero
- A new family of MRD-codes
- New maximum scattered linear sets of the projective line
- Fast decoding of Gabidulin codes
- MRD-codes arising from the trinomial \(x^q + x^{q^3} + c x^{q^5} \in \mathbb{F}_{q^6} [x\)]
- Systematic maximum sum rank codes
- Partition-balanced families of codes and asymptotic enumeration in coding theory
- New criteria for MRD and Gabidulin codes and some rank-metric code constructions
- Structural attacks for public key cryptosystems based on Gabidulin codes
- Ranks of tensors and change of base field
- Error-Correcting Regenerating and Locally Repairable Codes via Rank-Metric Codes
- Additive Rank Metric Codes
- Equivalence for Rank-Metric and Matrix Codes and Automorphism Groups of Gabidulin Codes
- Polynomial Codes Over Certain Finite Fields
- On MDS codes via Cauchy matrices
- Isometries for rank distance and permutation group of gabidulin codes
- Algebraic soft-decision decoding of reed-solomon codes
- Maximum rank distance codes as space~time codes
- Designing a Rank Metric Based McEliece Cryptosystem
- Coding for Errors and Erasures in Random Network Coding
- A Rank-Metric Approach to Error Control in Random Network Coding
- On generator matrices of MDS codes (Corresp.)
- Tensor codes for the rank metric
- Space-time codes for high data rate wireless communication: performance criterion and code construction
- New semifields and new MRD codes from skew polynomial rings
- Maximum distance<tex>q</tex>-nary codes
- Maximum-rank array codes and their application to crisscross error correction
This page was built for publication: Systematic encoders for generalized Gabidulin codes and the \(q\)-analogue of Cauchy matrices
