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 "on the precoder design of flat fading mimo systems equipped with mmse receivers a large system approach"):
  Abstract: This paper is devoted to the design of precoders maximizing the ergodic mutual information (EMI) of bi-correlated flat fading MIMO systems equipped with MMSE receivers. The channel state information and the second-order statistics of the channel are assumed available at the receiver side and at the transmitter side respectively. As the direct maximization of the EMI needs the use of nonattractive algorithms, it is proposed to optimize an approximation of the EMI, introduced recently, obtained when the number of transmit and receive antennas t and τ converge to ∞ at the same rate. It is established that the relative error between the actual EMI and its approximation is a O( [ 1/( t2)]) term. It is shown that the left singular eigenvectors of the optimum precoder coincide with the eigenvectors of the transmit covariance matrix, and its singular values are solution of a certain maximization problem. Numerical experiments show that the mutual information provided by this precoder is close from what is obtained by maximizing the true EMI, but that the algorithm maximizing the approximation is much less computationally intensive.

Includes members:
  Member "asymptotic performance of linear receivers in mimo fading channels":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "comments on physical layer cryptography through massive mimo")
  Member "performance of mmse mimo receivers a large n analysis for correlated channels":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "fifty years of mimo detection the road to large scale mimos")
  Member "ber and outage probability approximations for lmmse detectors on correlated mimo channels":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "max min sinr in large scale single cell mu mimo asymptotic analysis and low complexity transceivers")
  Member "a new approach for capacity analysis of large dimensional multi antenna channels":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "linear precoding based on polynomial expansion large scale multi cell mimo systems")
  Member "on the outage capacity of correlated multiple path mimo channels":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "glse precoders for massive mimo systems analysis and applications")

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)