Constructions of optimal rank-metric codes from automorphisms of rational function fields
From MaRDI portal
Abstract: We define a class of automorphisms of rational function fields of finite characteristic and employ these to construct different types of optimal linear rank-metric codes. The first construction is of generalized Gabidulin codes over rational function fields. Reducing these codes over finite fields, we obtain maximum rank distance (MRD) codes which are not equivalent to generalized twisted Gabidulin codes. We also construct optimal Ferrers diagram rank-metric codes which settles further a conjecture by Etzion and Silberstein.
Recommendations
Cites work
- A new family of linear maximum rank distance codes
- A New Family of MRD Codes in <inline-formula> <tex-math notation="LaTeX">$\mathbb{F_q}^{2n\times2n}$ </tex-math> </inline-formula> With Right and Middle Nuclei <inline-formula>
- A Rank-Metric Approach to Error Control in Random Network Coding
- Bilinear forms over a finite field, with applications to coding theory
- Constructions for Optimal Ferrers Diagram Rank-Metric Codes
- Constructions of optimal Ferrers diagram rank metric codes
- Convolutional Codes With Maximum Column Sum Rank for Network Streaming
- Efficient Encryption From Random Quasi-Cyclic Codes
- Equivalence for Rank-Metric and Matrix Codes and Automorphism Groups of Gabidulin Codes
- Error-Correcting Codes in Projective Spaces Via Rank-Metric Codes and Ferrers Diagrams
- Explicit constructions of some non-Gabidulin linear maximum rank distance codes
- Generalized Gabidulin codes over fields of any characteristic
- Generalized twisted Gabidulin codes
- scientific article; zbMATH DE number 177612 (Why is no real title available?)
- Identifiers for MRD-codes
- Isometries for rank distance and permutation group of gabidulin codes
- Low Rank Parity Check Codes: New Decoding Algorithms and Applications to Cryptography
- Maximal Ferrers Diagram Codes: Constructions and Genericity Considerations
- Maximum-rank array codes and their application to crisscross error correction
- MRD codes: constructions and connections
- New criteria for MRD and Gabidulin codes and some rank-metric code constructions
- New semifields and new MRD codes from skew polynomial rings
- On the design of algebraic space-time codes for MIMO block-fading channels
- On the genericity of maximum rank distance and Gabidulin codes
- Optimal Ferrers Diagram Rank-Metric Codes
- Reliable and Secure Multishot Network Coding Using Linearized Reed-Solomon Codes
- Skew and linearized Reed-Solomon codes and maximum sum rank distance codes over any division ring
- Structural attacks for public key cryptosystems based on Gabidulin codes
- Subspace codes from Ferrers diagrams
- Tensor codes for the rank metric
- Theory of codes with maximum rank distance
- Theory of supports for linear codes endowed with the sum-rank metric
- Twisted linearized Reed-Solomon codes: a skew polynomial framework
- Universal and Dynamic Locally Repairable Codes With Maximal Recoverability via Sum-Rank Codes
Cited in
(14)- Encoding and decoding of several optimal rank metric codes
- Constructions of rank metric codes under actions of the unitary groups
- Several classes of optimal Ferrers diagram rank-metric codes
- Nuclei and automorphism groups of generalized twisted Gabidulin codes
- Families of rational functions over finite fields and constructions of optical orthogonal codes
- A Construction of Permutation Codes From Rational Function Fields and Improvement to the Gilbert–Varshamov Bound
- Automorphism groups of Gabidulin-like codes
- Rank-metric codes over arbitrary Galois extensions and rank analogues of Reed-Muller codes
- A new construction of anticode-optimal Grassmannian codes
- Subspace codes from Ferrers diagrams
- Optimal Ferrers diagram rank-metric codes from MRD codes
- Antipodal two-weight rank metric codes
- A proof of the Etzion-Silberstein conjecture for monotone and MDS-constructible Ferrers diagrams
- Equivalence, group of automorphism and invariants of a family of rank metric codes arising from linearized polynomials
This page was built for publication: Constructions of optimal rank-metric codes from automorphisms of rational function fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6112233)
