Puncturing maximum rank distance codes
From MaRDI portal
Abstract: We investigate punctured maximum rank distance codes in cyclic models for bilinear forms of finite vector spaces. In each of these models we consider an infinite family of linear maximum rank distance codes obtained by puncturing generalized twisted Gabidulin codes. We calculate the automorphism group of such codes and we prove that this family contains many codes which are not equivalent to any generalized Gabidulin code. This solves a problem posed recently by Sheekey in [30].
Recommendations
- A new family of linear maximum rank distance codes
- Generalized twisted Gabidulin codes
- Non-linear maximum rank distance codes in the cyclic model for the field reduction of finite geometries
- Explicit constructions of some non-Gabidulin linear maximum rank distance codes
- Some new non-additive maximum rank distance codes
Cites work
- A generalization of the normal rational curve in \(\mathrm {PG}(d,q^n)\) and its associated non-linear MRD codes
- A new family of linear maximum rank distance codes
- A Rank-Metric Approach to Error Control in Random Network Coding
- Additive Rank Metric Codes
- Algebraic structures of MRD codes
- Automorphism groups of Gabidulin-like codes
- Bilinear forms over a finite field, with applications to coding theory
- Coding for Errors and Erasures in Random Network Coding
- Covering radius of matrix codes endowed with the rank metric
- Endliche Gruppen I
- External flats to varieties in \(\mathbb{P}\mathbb{G}(M_{n,n}(GF(q)))\)
- Generalized twisted Gabidulin codes
- scientific article; zbMATH DE number 177612 (Why is no real title available?)
- scientific article; zbMATH DE number 1235881 (Why is no real title available?)
- scientific article; zbMATH DE number 1101474 (Why is no real title available?)
- scientific article; zbMATH DE number 905159 (Why is no real title available?)
- scientific article; zbMATH DE number 3204743 (Why is no real title available?)
- scientific article; zbMATH DE number 6541785 (Why is no real title available?)
- Isometry and automorphisms of constant dimension codes
- Linearized polynomials over finite fields revisited
- Maximum scattered linear sets and MRD-codes
- MRD-codes and linear sets
- Non-linear maximum rank distance codes
- Non-linear maximum rank distance codes in the cyclic model for the field reduction of finite geometries
- Nuclei and automorphism groups of generalized twisted Gabidulin codes
- On the Similarities Between Generalized Rank and Hamming Weights and Their Applications to Network Coding
- Rank-metric codes and their duality theory
- Space-time codes for high data rate wireless communication: performance criterion and code construction
- The cyclic model for \(PG(n,q)\) and a construction of arcs
- Theory of codes with maximum rank distance
- Universal Secure Network Coding via Rank-Metric Codes
Cited in
(14)- Pseudo-ovals of elliptic quadrics as Delsarte designs of association schemes
- Scattered subspaces and related codes
- Orbit codes from forms on vector spaces over a finite field
- Scalar \(q\)-subresultants and Dickson matrices
- Binary additive MRD codes with minimum distance \(n-1\) must contain a semifield spread set
- Non-linear maximum rank distance codes in the cyclic model for the field reduction of finite geometries
- Isometries for rank distance and permutation group of gabidulin codes
- Maximum distance of anticodes
- scientific article; zbMATH DE number 2154122 (Why is no real title available?)
- Rank-metric codes over arbitrary Galois extensions and rank analogues of Reed-Muller codes
- scientific article; zbMATH DE number 5494664 (Why is no real title available?)
- Constructing MRD codes by switching
- Permutation polynomials and finite projective spaces
- Generalized twisted Gabidulin codes
This page was built for publication: Puncturing maximum rank distance codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2313418)
