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 "bit interleaved coded multiple beamforming with perfect coding"):
  Abstract: When the Channel State Information (CSI) is known by both the transmitter and the receiver, beamforming techniques employing Singular Value Decomposition (SVD) are commonly used in Multiple-Input Multiple-Output (MIMO) systems. Without channel coding, there is a trade-off between full diversity and full multiplexing. When channel coding is added, both of them can be achieved as long as the code rate R c  and the number of employed subchannels S satisfy the condition R c  S ≤1. By adding a properly designed constellation precoder, both full diversity and full multiplexing can be achieved for both uncoded and coded systems with the trade-off of a higher decoding complexity, e.g., Fully Precoded Multiple Beamforming (FPMB) and Bit-Interleaved Coded Multiple Beamforming with Full Precoding (BICMB-FP) without the condition R c  S ≤1. Recently discovered Perfect Space-Time Block Code (PSTBC) is a full-rate full-diversity space-time code, which achieves efficient shaping and high coding gain for MIMO systems. In this paper, a new technique, Bit-Interleaved Coded Multiple Beamforming with Perfect Coding (BICMB-PC), is introduced. BICMB-PC transmits PSTBCs through convolutional coded SVD systems. Similarly to BICMB-FP, BICMB-PC achieves both full diversity and full multiplexing, and its performance is almost the same as BICMB-FP. The advantage of BICMB-PC is that it can provide a much lower decoding complexity than BICMB-FP, since the real and imaginary parts of the received signal can be separated for BICMB-PC of dimensions 2 and 4, and only the part corresponding to the coded bit is required to acquire one bit metric for the Viterbi decoder.

Includes members:
  Member "precoding by pairing subchannels to increase mimo capacity with discrete input alphabets":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a survey on mimo transmission with discrete input signals technical challenges advances and future trends")
  Member "reduced complexity decoding for bit interleaved coded multiple beamforming with constellation precoding":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "multiple beamforming with perfect coding")
  Member "golden coded multiple beamforming":
    also connected through other hyperedges:
      (none)
  Member "constellation precoded beamforming":
    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 "constellation precoded multiple beamforming":
    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 "mimo precoding with x and y codes":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "steepest gradient based orthogonal precoder for integer forcing mimo")
  Member "reduced complexity sphere decoding":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "multiple beamforming with perfect coding")
  Member "bit interleaved coded multiple beamforming with constellation precoding":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "full diversity precoding design of bit interleaved coded multiple beamforming with orthogonal frequency division multiplexing")

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)