Space-Time Codes from Sum-Rank Codes

TL;DR

This paper introduces explicit minimal delay, rate-diversity optimal multiblock space-time codes derived from linearized Reed-Solomon codes, with decoders and simulations demonstrating superior low-SNR performance and smaller constellations.

Contribution

It provides the first explicit construction of such codes using linearized Reed-Solomon codes, enhancing space-time coding techniques for multiple fading blocks.

Findings

Codes outperform full diversity cyclic division algebra codes at low SNRs

Codes utilize significantly smaller constellations

Decoders are effectively designed for these codes

Abstract

Just as rank-metric or Gabidulin codes may be used to construct rate-diversity tradeoff optimal space-time codes, a recently introduced generalization for the sum-rank metric -- linearized Reed-Solomon codes -- accomplishes the same in the case of multiple fading blocks. In this paper, we provide the first explicit construction of minimal delay rate-diversity optimal multiblock space-time codes as an application of linearized Reed-Solomon codes. We also provide sequential decoders for these codes and, more generally, space-time codes constructed from finite field codes. Simulation results show that the proposed codes can outperform full diversity codes based on cyclic division algebras at low SNRs as well as utilize significantly smaller constellations.