AI编程能力边界探索：基于 Claude Code 的 Spec Coding 项目实战｜得物技术

Fast-decodable distributed space-time codes are constructed by adapting the iterative code construction introduced in [1] to the N -relay multiple-input multiple-output channel, leading to the first fast-decodable distributed space-time codes for more than one antenna per user. Explicit constructions are provided alongside with a performance comparison to non-iterated (non-) fast-decodable codes.

In this paper, we prove existence of optimal complementary dual codes (LCD codes) over large finite fields. We also give methods to generate orthogonal matrices over finite fields and then apply them to construct LCD codes. Construction methods include random sampling in the orthogonal group, code extension, matrix product codes and projection over a self-dual basis.

We give a complete list of orbit codes that are generated by an irreducible cyclic group, i.e. an irreducible group having one generator. We derive some of the basic properties of these codes such as the cardinality and the minimum distance.