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 "performance analysis of protograph ldpc codes for nakagami m fading relay channels"):
  Abstract: In this paper, we investigate the error performance of the protograph (LDPC) codes over Nakagami-$m$ fading relay channels. We first calculate the decoding thresholds of the protograph codes over such channels with different fading depths (i.e., different values of $m$) by exploiting the modified protograph extrinsic information transfer (PEXIT) algorithm. Furthermore, based on the PEXIT analysis and using Gaussian approximation, we derive the bit-error-rate (BER) expressions for the error-free (EF) relaying protocol and decode-and-forward (DF) relaying protocol. We finally compare the threshold with the theoretical BER and the simulated BER results of the protograph codes. It reveals that the performance of DF protocol is approximately the same as that of EF protocol. Moreover, the theoretical BER expressions, which are shown to be reasonably consistent with the decoding thresholds and the simulated BERs, are able to evaluate the system performance and predict the decoding threshold with lower complexity as compared to the modified PEXIT algorithm. As a result, this work can facilitate the design of the protograph codes for the wireless communication systems.

Includes members:
  Member "performance analysis of protograph based ldpc codes with spatial diversity":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "performance of joint channel and physical network coding based on alamouti stbc")
  Member "bilayer protograph codes for half duplex relay channels":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "coding and system design for quantize map and forward relaying")

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)