Connections between scattered linear sets and MRD-codes
From MaRDI portal
Abstract: The aim of this paper is to survey on the known results on maximum scattered linear sets and MRD-codes. In particular, we investigate the link between these two areas. In "A new family of linear maximum rank distance codes" (2016) Sheekey showed how maximum scattered linear sets of define square MRD-codes. Later in "Maximum scattered linear sets and MRD-codes" (2017) maximum scattered linear sets in , , were used to construct non square MRD-codes. Here, we point out a new relation regarding the other direction. We also provide an alternative proof of the well-known Blokhuis-Lavrauw's bound for the rank of maximum scattered linear sets shown in "Scattered spaces with respect to a spread in " (2000).
Recommendations
- Maximum scattered linear sets and MRD-codes
- Linear sets and MRD-codes arising from a class of scattered linearized polynomials
- MRD-codes and linear sets
- Scattered subspaces and related codes
- MRD codes: constructions and connections
- Partially scattered linearized polynomials and rank metric codes
- On the sparseness of certain linear MRD codes
- Common Complements of Linear Subspaces and the Sparseness of MRD Codes
- Linearized decomposition codes and finite integer set coverings
Cited in
(38)- Maximum scattered linear sets and MRD-codes
- A generalization of the normal rational curve in \(\mathrm {PG}(d,q^n)\) and its associated non-linear MRD codes
- Linear sets and MRD-codes arising from a class of scattered linearized polynomials
- Scattered subspaces and related codes
- The geometry of one-weight codes in the sum-rank metric
- The geometric field of linearity of linear sets
- \(r\)-fat linearized polynomials over finite fields
- Extending two families of maximum rank distance codes
- 50 years of translation structures
- Non-minimum tensor rank Gabidulin codes
- Linear cutting blocking sets and minimal codes in the rank metric
- On linear sets of minimum size
- Partially scattered linearized polynomials and rank metric codes
- Rank-metric codes, linear sets, and their duality
- Investigating the exceptionality of scattered polynomials
- The weight distributions of linear sets in \(\mathrm{PG}(1,q^5)\)
- A new family of maximum scattered linear sets in \(\mathrm{PG}(1,q^6)\)
- MRD-codes and linear sets
- Cones from maximum \(h\)-scattered linear sets and a stability result for cylinders from hyperovals
- A higgledy-piggledy set of planes based on the ABB-representation of linear sets
- On the equivalence issue of a class of 2-dimensional linear maximum rank distance codes
- On a family of linear MRD codes with parameters \([8\times 8,16,7]_q\)
- Saturating linear sets in \(\mathrm{PG}(2,q^4)\)
- A standard form for scattered linearized polynomials and properties of the related translation planes
- Clubs and their applications
- New scattered linearized quadrinomials
- Maximum weight codewords of a linear rank-metric code
- Non-linear MRD codes from cones over exterior sets
- On the minimum size of linear sets
- Schubert subspace codes
- Towards the classification of exceptional scattered polynomials
- Automorphism groups of maximum scattered linear sets in finite projective lines
- On MSRD codes, h-designs and disjoint maximum scattered linear sets
- Generalised evasive subspaces
- Towards the classification of maximum scattered linear sets of \(\mathrm{PG}(1,q^5)\)
- Scattered polynomials: an overview on their properties, connections and applications
- Rank-metric codes over arbitrary fields: bounds and constructions
- Regular fat linear sets
This page was built for publication: Connections between scattered linear sets and MRD-codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3295493)
