Non-linear maximum rank distance codes
DOI10.1007/S10623-015-0108-0zbMATH Open1386.94112OpenAlexW2175076659MaRDI QIDQ281322FDOQ281322
Authors: Giuseppe Marino, Francesco Pavese, Antonio Cossidente 
Publication date: 10 May 2016
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-015-0108-0
Segre varietysubspace codesconstant rank distance codemaximum rank distance codeSinger cyclic groupVeronese variety
Combinatorial structures in finite projective spaces (51E20) Projective techniques in algebraic geometry (14N05) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Other types of codes (94B60)
Cites Work
- Subgeometries and linear sets on a projective line
- Field reduction and linear sets in finite geometry
- Title not available (Why is that?)
- Title not available (Why is that?)
- Bilinear forms over a finite field, with applications to coding theory
- Mixed partitions of PG\((5,q)\)
- Endliche Gruppen I
- Maximum scattered linear sets of pseudoregulus type and the Segre variety \(\mathcal{S}_{n,n}\)
- Exterior splashes and linear sets of rank 3
- Scattered linear sets generated by collineations between pencils of lines
- On the automorphism group of planes of Figueroa type
- Theory of codes with maximum rank distance
- On the flocks of \(Q^+(3,q)\)
- A fimily of not \((V,\ell)\)-transitive projective planes of order \(q^3\), \(q \not\equiv 1 (\mod 3)\) and \(q>2\)
- Flocks of hyperbolic quadrics and linear groups containing homologies
- External flats to varieties in \(\mathbb{P}\mathbb{G}(M_{n,n}(GF(q)))\)
- (\(B\))-geometries and flocks of hyperbolic quadrics
- Teoria di Galois, fibrazioni proiettive e geometrie non desarguesiane
- Generalization flocks of \(\mathcal Q^+(3,q)\)
- Some partitions in Figueroa planes
- Coding for Errors and Erasures in Random Network Coding
- A Rank-Metric Approach to Error Control in Random Network Coding
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Constant-Rank Codes and Their Connection to Constant-Dimension Codes
- Bounds on List Decoding of Rank-Metric Codes
- Title not available (Why is that?)
- Maximum-rank array codes and their application to crisscross error correction
- Rank properties of subspaces of symmetric and Hermitian matrices over finite fields
Cited In (27)
- On absolute points of correlations of \(\mathrm{PG}(2,q^{n})\)
- On kernels and nuclei of rank metric codes
- Identifiers for MRD-codes
- Generalized bilinear forms graphs and MRD codes over a residue class ring
- Self-duality of generalized twisted Gabidulin codes
- Constructions of rank metric codes under actions of the unitary groups
- Puncturing maximum rank distance codes
- A new family of linear maximum rank distance codes
- Some new non-additive maximum rank distance codes
- Title not available (Why is that?)
- New semifields and new MRD codes from skew polynomial rings
- Generalized twisted Gabidulin codes
- Nuclei and automorphism groups of generalized twisted Gabidulin codes
- MRD codes with maximum idealizers
- Non-linear maximum rank distance codes in the cyclic model for the field reduction of finite geometries
- Non-linear MRD codes from cones over exterior sets
- Matrix graphs and MRD codes over finite principal ideal rings
- Constructing MRD codes by switching
- Binary additive MRD codes with minimum distance \(n-1\) must contain a semifield spread set
- Exceptional scattered polynomials
- On the number of inequivalent Gabidulin codes
- On the genericity of maximum rank distance and Gabidulin codes
- A generalization of the normal rational curve in \(\mathrm {PG}(d,q^n)\) and its associated non-linear MRD codes
- On the sparseness of certain linear MRD codes
- An asymptotically optimal construction of almost affinely disjoint subspaces
- New criteria for MRD and Gabidulin codes and some rank-metric code constructions
- MRD-codes arising from the trinomial \(x^q + x^{q^3} + c x^{q^5} \in \mathbb{F}_{q^6} [x]\)
Uses Software
This page was built for publication: Non-linear maximum rank distance codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q281322)
