A Unified Construction of Space–Time Codes With Optimal Rate–Diversity Tradeoff

DOI10.1109/TIT.2005.846403zbMath1309.94105OpenAlexW2126824576MaRDI QIDQ3547288

Hsiao-Feng Lu (Francis), P. Vijay Kumar

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.2005.846403

Mathematics Subject Classification ID

Channel models (including quantum) in information and communication theory (94A40)

Related Items (16)

Sum-rank product codes and bounds on the minimum distance ⋮ Twisted linearized Reed-Solomon codes: a skew polynomial framework ⋮ A General Family of MSRD Codes and PMDS Codes with Smaller Field Sizes from Extended Moore Matrices ⋮ Duals of linearized Reed-Solomon codes ⋮ Systematic maximum sum rank codes ⋮ Fast Kötter-Nielsen-Høholdt interpolation over skew polynomial rings and its application in coding theory ⋮ Interpolation-based decoding of folded variants of linearized and skew Reed-Solomon codes ⋮ Distinguishing and recovering generalized linearized Reed-Solomon codes ⋮ Some matroids related to sum-rank metric codes ⋮ Unnamed Item ⋮ Asymptotic behaviour of codes in rank metric over finite fields ⋮ On Space-Time Codes Arising from Free Modules and Algebras over an Integral Domain ⋮ Theory of supports for linear codes endowed with the sum-rank metric ⋮ Hamming and simplex codes for the sum-rank metric ⋮ The geometry of one-weight codes in the sum-rank metric ⋮ Codes in the Sum-Rank Metric: Fundamentals and Applications

This page was built for publication: A Unified Construction of Space–Time Codes With Optimal Rate–Diversity Tradeoff