Maximum rank distance codes as space~time codes
From MaRDI portal
Publication:3547322
DOI10.1109/TIT.2003.818023zbMath1301.94063OpenAlexW2136571043MaRDI QIDQ3547322
P. Lusina, Martin Bossert, Ernst M. Gabidulin
Publication date: 21 December 2008
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.2003.818023
Related Items (14)
Constructions of rank metric codes under actions of the unitary groups ⋮ Further results on LCD generalized Gabidulin codes ⋮ Rank subcodes in multicomponent network coding ⋮ Equivalence and characterizations of linear rank-metric codes based on invariants ⋮ Unnamed Item ⋮ Symmetric matrices and codes correcting rank errors beyond the \(\lfloor(d-1)/2 \rfloor\) bound ⋮ On decoding additive generalized twisted Gabidulin codes ⋮ On the list decodability of self-orthogonal rank-metric codes ⋮ Vertex properties of maximum scattered linear sets of \(\mathrm{PG} ( 1 , q^n )\) ⋮ Systematic encoders for generalized Gabidulin codes and the \(q\)-analogue of Cauchy matrices ⋮ Decoding of random network codes ⋮ MRD codes with maximum idealizers ⋮ Rank-Metric Codes and Their Applications ⋮ Codes in the Sum-Rank Metric: Fundamentals and Applications
This page was built for publication: Maximum rank distance codes as space~time codes
