human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "fast decodable space time codes for the n relay and multiple access mimo channel"):
  Abstract: In this article, the first general constructions of fast-decodable, more specifically (conditionally)   $g$  -group decodable, space–time block codes for the nonorthogonal amplify and forward (NAF) multiple-input multiple-output (MIMO) relay channel under the half-duplex constraint are proposed. In this scenario, the source and the intermediate relays used for data amplification are allowed to employ multiple antennas for data transmission and reception. The worst-case decoding complexity of the obtained codes is reduced by up to 75%. In addition to being fast-decodable, the proposed codes achieve full-diversity and have nonvanishing determinants, which has been shown to be useful for achieving the optimal diversity-multiplexing tradeoff (DMT) of the NAF channel. Furthermore, it is shown that the same techniques as in the cooperative scenario can be utilized to achieve fast-decodability for   $K$  -user MIMO multiple-access channel (MAC) space–time block codes. The resulting codes in addition exhibit the conditional nonvanishing determinant property which, for its part, has been shown to be useful for achieving the optimal MAC-DMT.

Includes members:
  Member "constructions of fast decodable distributed space time codes":
    also connected through other hyperedges:
      (none)
  Member "bounds on fast decodability of space time block codes skew hermitian matrices and azumaya algebras":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "lattice codes for physical layer communications")
  Member "algebraic codes and a new physical layer transmission protocol for wireless distributed storage systems":
    also connected through other hyperedges:
      (none)
  Member "fast decodable asymmetric space time codes from division algebras":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a survey on mimo transmission with discrete input signals technical challenges advances and future trends")
  Member "iterated space time code constructions from cyclic algebras":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a survey on mimo transmission with discrete input signals technical challenges advances and future trends")
  Member "algebraic fast decodable relay codes for distributed communications":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "constructions of fast decodable distributed space time codes")
  Member "quadratic forms and space time block codes from generalized quaternion and biquaternion algebras":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "revisited design criteria for stbcs with reduced complexity ml decoding")
  Member "minimizing the complexity of fast sphere decoding of stbcs":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "on fast decodable algebraic space time codes")

Question: Please tell me which class the source paper belongs to. The 40 classes are: cs.NA(Numerical Analysis), cs.MM(Multimedia), cs.LO(Logic in Computer Science), cs.CY(Computers and Society), cs.CR(Cryptography and Security), cs.DC(Distributed, Parallel, and Cluster Computing), cs.HC(Human-Computer Interaction), cs.CE(Computational Engineering, Finance, and Science), cs.NI(Networking and Internet Architecture), cs.CC(Computational Complexity), cs.AI(Artificial Intelligence), cs.MA(Multiagent Systems), cs.GL(General Literature), cs.NE(Neural and Evolutionary Computing), cs.SC(Symbolic Computation), cs.AR(Hardware Architecture), cs.CV(Computer Vision and Pattern Recognition), cs.GR(Graphics), cs.ET(Emerging Technologies), cs.SY(Systems and Control), cs.CG(Computational Geometry), cs.OH(Other Computer Science), cs.PL(Programming Languages), cs.SE(Software Engineering), cs.LG(Machine Learning), cs.SD(Sound), cs.SI(Social and Information Networks), cs.RO(Robotics), cs.IT(Information Theory), cs.PF(Performance), cs.CL(Computation and Language), cs.IR(Information Retrieval), cs.MS(Mathematical Software), cs.FL(Formal Languages and Automata Theory), cs.DS(Data Structures and Algorithms), cs.OS(Operating Systems), cs.GT(Computer Science and Game Theory), cs.DB(Databases), cs.DL(Digital Libraries), cs.DM(Discrete Mathematics). Directly output the class name.

gpt: cs.IT(Information Theory)