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 "generalized silver codes"):
  Abstract: For an $n_t$ transmit, $n_r$ receive antenna system ($n_t \times n_r$ system), a {\it{full-rate}} space time block code (STBC) transmits $n_{min} = min(n_t,n_r)$ complex symbols per channel use. The well known Golden code is an example of a full-rate, full-diversity STBC for 2 transmit antennas. Its ML-decoding complexity is of the order of $M^{2.5}$ for square $M$-QAM. The Silver code for 2 transmit antennas has all the desirable properties of the Golden code except its coding gain, but offers lower ML-decoding complexity of the order of $M^2$. Importantly, the slight loss in coding gain is negligible compared to the advantage it offers in terms of lowering the ML-decoding complexity. For higher number of transmit antennas, the best known codes are the Perfect codes, which are full-rate, full-diversity, information lossless codes (for $n_r \geq n_t$) but have a high ML-decoding complexity of the order of $M^{n_tn_{min}}$ (for $n_r < n_t$, the punctured Perfect codes are considered). In this paper, a scheme to obtain full-rate STBCs for $2^a$ transmit antennas and any $n_r$ with reduced ML-decoding complexity of the order of $M^{n_t(n_{min}-(3/4))-0.5}$, is presented. The codes constructed are also information lossless for $n_r \geq n_t$, like the Perfect codes and allow higher mutual information than the comparable punctured Perfect codes for $n_r < n_t$. These codes are referred to as the {\it generalized Silver codes}, since they enjoy the same desirable properties as the comparable Perfect codes (except possibly the coding gain) with lower ML-decoding complexity, analogous to the Silver-Golden codes for 2 transmit antennas. Simulation results of the symbol error rates for 4 and 8 transmit antennas show that the generalized Silver codes match the punctured Perfect codes in error performance while offering lower ML-decoding complexity.

Includes members:
  Member "asymptotically optimal fast decodable full diversity stbcs":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "an adaptive conditional zero forcing decoder with full diversity least complexity and essentially ml performance for stbcs")
  Member "four group decodable space time block codes":
    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 "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 "on fast 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")

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)