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 "achieving low complexity maximum likelihood detection for the 3d mimo code"):
  Abstract: The 3D MIMO code is a robust and efficient space-time block code (STBC) for the distributed MIMO broadcasting but suffers from high maximum-likelihood (ML) decoding complexity. In this paper, we first analyze some properties of the 3D MIMO code to show that the 3D MIMO code is fast-decodable. It is proved that the ML decoding performance can be achieved with a complexity of O(M^{4.5}) instead of O(M^8) in quasi static channel with M-ary square QAM modulations. Consequently, we propose a simplified ML decoder exploiting the unique properties of 3D MIMO code. Simulation results show that the proposed simplified ML decoder can achieve much lower processing time latency compared to the classical sphere decoder with Schnorr-Euchner enumeration.

Includes members:
  Member "a new family of low complexity stbcs for four transmit antennas":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a fast decodable full rate stbc with high coding gain for 4 2 mimo systems")
  Member "distributed mimo coding scheme with low decoding complexity for future mobile tv broadcasting":
    also connected through other hyperedges:
      (none)
  Member "minimizing the complexity of fast sphere decoding of stbcs":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on fast decodable algebraic space time codes")
  Member "two designs of space time block codes achieving full diversity with partial interference cancellation group decoding":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "joint source channel and space time coding of progressive sources in mimo systems")
  Member "four group decodable space time block codes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a survey on mimo transmission with discrete input signals technical challenges advances and future trends")
  Member "on full diversity space time block codes with partial interference cancellation group decoding":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "on low complexity full diversity detection in multi user mimo multiple access channels")
  Member "fast maximum likelihood decoding of the golden code":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "a survey on mimo transmission with discrete input signals technical challenges advances and future trends")
  Member "3d mimo scheme for broadcasting future digital tv in single frequency networks":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "a fast decodable full rate stbc with high coding gain for 4 2 mimo systems")

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)