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 "d mg tradeoff and optimal codes for a class of af and df cooperative communication protocols"):
  Abstract: We consider cooperative relay communication in a fading channel environment under the Orthogonal Amplify and Forward (OAF) and Orthogonal and Non-Orthogonal Selection Decode and Forward (OSDF and NSDF) protocols. For all these protocols, we compute the Diversity-Multiplexing Gain Tradeoff (DMT). We construct DMT optimal codes for the protocols which are sphere decodable and, in certain cases, incur minimum possible delay. Our results establish that the DMT of the OAF protocol is identical to the DMT of the Non-Orthogonal Amplify and Forward (NAF) protocol. Two variants of the NSDF protocol are considered: fixed-NSDF and variable-NSDF protocol. In the variable-NSDF protocol, the fraction of time duration for which the source alone transmits is allowed to vary with the rate of communication. Among the class of static amplify-and-forward and decode-and-forward protocols, the variable-NSDF protocol is shown to have the best known DMT for any number of relays apart from the two-relay case. When there are two relays, the variable-NSDF protocol is shown to improve on the DMT of the best previously-known protocol for higher values of the multiplexing gain. Our results also establish that the fixed-NSDF protocol has a better DMT than the NAF protocol for any number of relays. Finally, we present a DMT optimal code construction for the NAF protocol.

Includes members:
  Member "diversity multiplexing tradeoff of the half duplex relay channel":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "when are dynamic relaying strategies necessary in half duplex wireless networks")
  Member "approximate capacity of gaussian relay networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "multihop backhaul compression for the uplink of cloud radio access networks")
  Member "towards the optimal amplify and forward cooperative diversity scheme":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "relay pair selection in buffer aided successive opportunistic relaying using a multi antenna source")
  Member "optimal space time codes for the mimo amplify and forward cooperative channel":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "unmanned aerial vehicle assisted cellular communication")
  Member "approximately universal codes over slow fading channels":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "space time signal design for multilevel polar coding in slow fading broadcast channels")
  Member "on the achievable diversity multiplexing tradeoffs in half duplex cooperative channels":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "algebraic fast decodable relay codes for distributed communications")
  Member "perfect space time codes with minimum and non minimum delay for any number of antennas":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "bit interleaved coded multiple beamforming with perfect coding")

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)