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 "stbcs with reduced sphere decoding complexity for two user mimo mac"):
  Abstract: In this paper, Space-Time Block Codes (STBCs) with reduced Sphere Decoding Complexity (SDC) are constructed for two-user Multiple-Input Multiple-Output (MIMO) fading multiple access channels. In this set-up, both the users employ identical STBCs and the destination performs sphere decoding for the symbols of the two users. First, we identify the positions of the zeros in the $\textbf{R}$ matrix arising out of the Q-R decomposition of the lattice generator such that (i) the worst case SDC (WSDC) and (ii) the average SDC (ASDC) are reduced. Then, a set of necessary and sufficient conditions on the lattice generator is provided such that the $\textbf{R}$ matrix has zeros at the identified positions. Subsequently, explicit constructions of STBCs which results in the reduced ASDC are presented. The rate (in complex symbols per channel use) of the proposed designs is at most $2/N_{t}$ where $N_{t}$ denotes the number of transmit antennas for each user. We also show that the class of STBCs from complex orthogonal designs (other than the Alamouti design) reduce the WSDC but not the ASDC.

Includes members:
  Member "coding for two user siso and mimo multiple access channels":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "orthogonal vs non orthogonal multiple access with finite input alphabet and finite bandwidth")
  Member "low ml decoding complexity large coding gain full rate full diversity stbcs for 2 x 2 and 4 x 2 mimo systems":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a new low complexity decodable rate 5 4 stbc for four transmit antennas with nonvanishing determinants")
  Member "fast maximum likelihood decoding of the golden code":
    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 "high rate single symbol decodable precoded dstbcs for cooperative networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "multi group ml decodable collocated and distributed space time block codes")
  Member "on fast decodable space time block codes":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "a survey on mimo transmission with discrete input signals technical challenges advances and future trends")

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)