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

DOI10.1109/TIT.2005.846403MaRDI QIDQ3547288zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Rate-diversity tradeoff of space-time codes with fixed alphabet and optimal constructions for psk modulation
• Explicit Space–Time Codes Achieving the Diversity–Multiplexing Gain Tradeoff
• On constructions of algebraic space-time codes with AM-PSK constellations satisfying rate-diversity tradeoff
• Space-time block codes from orthogonal designs
• Constructions of unitary space-time codes with full diversity

Cited in

(35)

• The geometry of one-weight codes in the sum-rank metric
• Sum-rank product codes and bounds on the minimum distance
• Twisted linearized Reed-Solomon codes: a skew polynomial framework
• Systematic maximum sum rank codes
• Theory of supports for linear codes endowed with the sum-rank metric
• Asymptotic behaviour of codes in rank metric over finite fields
• Duals of linearized Reed-Solomon codes
• Some matroids related to sum-rank metric codes
• On constructions of algebraic space-time codes with AM-PSK constellations satisfying rate-diversity tradeoff
• Rate-diversity tradeoff of space-time codes with fixed alphabet and optimal constructions for psk modulation
• Approximately universal codes over slow-fading channels
• Perfect Space–Time Block Codes
• Explicit Space–Time Codes Achieving the Diversity–Multiplexing Gain Tradeoff
• On Space–Time Trellis Codes Achieving Optimal Diversity Multiplexing Tradeoff
• Unitary Space–Time Constellation Analysis: An Upper Bound for the Diversity
• Constructions of Multiblock Space–Time Coding Schemes That Achieve the Diversity–Multiplexing Tradeoff
• Space-time block codes: a maximum SNR approach
• Square-matrix embeddable space-time block codes for complex signal constellations
• A construction of a space-time code based on number theory
• Existence and construction of noncoherent unitary space-time codes
• Space–Time Codes Achieving the DMD Tradeoff of the MIMO-ARQ Channel
• A Space–Time Code Design for CPM: Diversity Order and Coding Gain
• Improved list-decodability of random linear binary codes
• A general family of MSRD codes and PMDS codes with smaller field sizes from extended Moore matrices
• On space-time codes arising from free modules and algebras over an integral domain
• Codes in the sum-rank metric: fundamentals and applications
• 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
• New constructions of MSRD codes
• Fast decoding of interleaved linearized Reed-Solomon codes and variants
• Multilayer crisscross error and erasure correction
• Bounds on sphere sizes in the sum-rank metric and coordinate-additive metrics
• Gabidulin codes achieve list decoding capacity with an order-optimal column-to-row ratio
• Hamming and simplex codes for the sum-rank metric

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3547288)