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 "time out lattice sequential decoding for the mimo arq channel"):
  Abstract: The optimal diversity-multiplexing-delay tradeoff for the multi- input multi-output (MIMO) automatic repeat request (ARQ) channel can be achieved using an incremental redundancy lattice space- time codes. The optimal tradeoff has been shown in [1] to be achieved using a list lattice decoder for joint detection and decoding. However, such decoder suffers from high computational complexity for low-to-moderate signal-to-noise ratios, especially for large signal's dimension. In this paper, we would like to construct a more efficient decoder that is capable of achieving the optimal tradeoff with much lower complexity. We show, analytically and via simulation, that using a modified lattice sequential decoder for joint error detection and correction in the MIMO ARQ channel, the optimal tradeoff can be achieved with significant reduction in decoder complexity at a very small degradation in performance.

Includes members:
  Member "lattice sequential decoder for coded mimo channel performance and complexity analysis":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "sphere decoding complexity exponent for decoding full rate codes over the quasi static mimo channel")
  Member "asymptotic performance of linear receivers in mimo fading channels":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "comments on physical layer cryptography through massive mimo")

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)