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 "golden coded multiple beamforming"):
  Abstract: The Golden Code is a full-rate full-diversity space-time code, which achieves maximum coding gain for Multiple-Input Multiple-Output (MIMO) systems with two transmit and two receive antennas. Since four information symbols taken from an M-QAM constellation are selected to construct one Golden Code codeword, a maximum likelihood decoder using sphere decoding has the worst-case complexity of O(M4), when the Channel State Information (CSI) is available at the receiver. Previously, this worst-case complexity was reduced to O(M2.5) without performance degradation. When the CSI is known by the transmitter as well as the receiver, beamforming techniques that employ singular value decomposition are commonly used in MIMO systems. In the absence of channel coding, when a single symbol is transmitted, these systems achieve the full diversity order provided by the channel. Whereas this property is lost when multiple symbols are simultaneously transmitted. However, uncoded multiple beamforming can achieve the full diversity order by adding a properly designed constellation precoder. For 2 × 2 Fully Precoded Multiple Beamforming (FPMB), the general worst-case decoding complexity is O(M). In this paper, Golden Coded Multiple Beamforming (GCMB) is proposed, which transmits the Golden Code through 2 × 2 multiple beamforming. GCMB achieves the full diversity order and its performance is similar to general MIMO systems using the Golden Code and FPMB, whereas the worst-case decoding complexity of O(sqrt(M)) is much lower. The extension of GCMB to larger dimensions is also discussed.

Includes members:
  Member "constellation precoded beamforming":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "full diversity precoding design of bit interleaved coded multiple beamforming with orthogonal frequency division multiplexing")
  Member "fast maximum likelihood decoding of the golden code":
    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 "reduced complexity sphere decoding for square qam via a new lattice representation":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "full diversity precoding design of bit interleaved coded multiple beamforming with orthogonal frequency division multiplexing")
  Member "perfect space time codes with minimum and non minimum delay for any number of antennas":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "bit interleaved coded multiple beamforming with perfect coding")

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)