human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "error performance of multidimensional lattice constellations part ii evaluation over fading channels"
  Abstract: This is the second part of a two-part series of papers, where the error performance of multidimensional lattice constellations with signal space diversity (SSD) is investigated. In Part I, following a novel combinatorial geometrical approach which is based on parallelotope geometry, we have presented an exact analytical expression and two closed-form bounds for the symbol error probability (SEP) in Additive White Gaussian Noise (AWGN). In the present Part II, we extend the analysis and present a novel analytical expression for the Frame Error Probability (FEP) of multidimensional lattice constellations over Nakagami-m fading channels. As the FEP of infinite lattice constellations is lower bounded by the Sphere Lower Bound (SLB), we propose the Sphere Upper Bound (SUB) for block fading channels. Furthermore, two novel bounds for the FEP of multidimensional lattice constellations over block fading channels, named Multiple Sphere Lower Bound (MSLB) and Multiple Sphere Upper Bound (MSUB), are presented. The expressions for the SLB and SUB are given in closed form, while the corresponding ones for MSLB and MSUB are given in closed form for unitary block length. Numerical and simulation results illustrate the tightness of the proposed bounds and demonstrate that they can be efficiently used to set the performance limits on the FEP of lattice constellations of arbitrary structure, dimension and rank.

Connected through hyperedge HE-1 (induced by source paper "error performance of multidimensional lattice constellations part i a parallelotope geometry based approach for the awgn channel"):
  with members:
    - "sphere lower bound for rotated lattice constellations in fading channels"

Question: Please tell me which class the center node 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)