Some new non-additive maximum rank distance codes
From MaRDI portal
Publication:1696763
DOI10.1016/j.ffa.2017.12.003zbMath1454.94138OpenAlexW2778570824MaRDI QIDQ1696763
Publication date: 15 February 2018
Published in: Finite Fields and their Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ffa.2017.12.003
linearized polynomialsrank metric codesmaximum rank distance (MRD) codesadditive generalized twisted Gabidulin codes
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Relations with coding theory (11H71)
Related Items (8)
Self-duality of generalized twisted Gabidulin codes ⋮ MRD-codes arising from the trinomial \(x^q + x^{q^3} + c x^{q^5} \in \mathbb{F}_{q^6} [x\)] ⋮ Identifiers for MRD-codes ⋮ Systematic maximum sum rank codes ⋮ Generalized twisted Gabidulin codes ⋮ MRD codes with maximum idealizers ⋮ An asymptotically optimal construction of almost affinely disjoint subspaces ⋮ Encoding and decoding of several optimal rank metric codes
Cites Work
- Non-linear maximum rank distance codes
- A new family of linear maximum rank distance codes
- Algebraic structures of MRD codes
- Explicit constructions of some non-Gabidulin linear maximum rank distance codes
- Generalized twisted Gabidulin codes
- Galois theory and linear algebra
- Theory of codes with maximum rank distance
- Bilinear forms over a finite field, with applications to coding theory
- Non-linear maximum rank distance codes in the cyclic model for the field reduction of finite geometries
- New criteria for MRD and Gabidulin codes and some rank-metric code constructions
- Additive Rank Metric Codes
- A Rank-Metric Approach to Error Control in Random Network Coding
- Space-time codes for high data rate wireless communication: performance criterion and code construction
- Maximum-rank array codes and their application to crisscross error correction
- Unnamed Item
- Unnamed Item
This page was built for publication: Some new non-additive maximum rank distance codes
