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 "incomplete decode and forward protocol using distributed space time block codes"):
  Abstract: In this work, we explore the introduction of distributed space-time codes in decode-and-forward (DF) protocols. A first protocol named the Asymmetric DF is presented. It is based on two phases of different lengths, defined so that signals can be fully decoded at relays. This strategy brings full diversity but the symbol rate is not optimal. To solve this problem a second protocol named the Incomplete DF is defined. It is based on an incomplete decoding at the relays reducing the length of the first phase. This last strategy brings both full diversity and full symbol rate. The outage probability and the simulation results show that the Incomplete DF has better performance than any existing DF protocol and than the non-orthogonal amplify-and-forward (NAF) strategy using the same space-time codes. Moreover the diversity-multiplexing gain tradeoff (DMT) of this new DF protocol is proven to be the same as the one of the NAF.

Includes members:
  Member "diversity of mimo multihop relay channels":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "cooperation and underlay mode selection in cognitive radio network")
  Member "optimal space time codes for the mimo amplify and forward cooperative channel":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "unmanned aerial vehicle assisted cellular communication")

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)