Dirk Liebhold

Learn More
LetK/k be a cyclic Galois extension of degree l and θ a generator of Gal(K/k). For any v = (v1, . . . , vm) ∈ K m such that v is linearly independent over k, and any 1 ≤ d < m the Gabidulin-like code C(v, θ, d) ≤ kl×m is a maximum rank distance code of dimension ld over k. This construction unifies the ones available in the literature. We characterise the(More)
  • 1