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 "a probabilistic peeling decoder to efficiently analyze generalized ldpc codes over the bec"):
  Abstract: In this paper, we analyze the tradeoff between coding rate and asymptotic performance of a class of generalized low-density parity-check (GLDPC) codes constructed by including a certain fraction of generalized constraint (GC) nodes in the graph. The rate of the GLDPC ensemble is bounded using classical results on linear block codes, namely Hamming bound and Varshamov bound. We also study the impact of the decoding method used at GC nodes. To incorporate both bounded-distance (BD) and Maximum Likelihood (ML) decoding at GC nodes into our analysis without resorting on multi-edge type of degree distributions (DDs), we propose the probabilistic peeling decoding (P-PD) algorithm, which models the decoding step at every GC node as an instance of a Bernoulli random variable with a successful decoding probability that depends on both the GC block code as well as its decoding algorithm. The P-PD asymptotic performance over the BEC can be efficiently predicted using standard techniques for LDPC codes such as density evolution (DE) or the differential equation method. Furthermore, for a class of GLDPC ensembles, we demonstrate that the simulated P-PD performance accurately predicts the actual performance of the GLPDC code under ML decoding at GC nodes. We illustrate our analysis for GLDPC code ensembles with regular DDs. In all cases, we show that a large fraction of GC nodes is required to reduce the original gap to capacity, but the optimal fraction is strictly smaller than one. We then consider techniques to further reduce the gap to capacity by means of random puncturing, and the inclusion of a certain fraction of generalized variable nodes in the graph.

Includes members:
  Member "design of ldpc code ensembles with fast convergence properties":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "spatially coupled generalized ldpc codes asymptotic analysis and finite length scaling")
  Member "a scaling law to predict the finite length performance of spatially coupled ldpc codes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "finite length scaling of spatially coupled ldpc codes under window decoding over the bec")
  Member "on the minimum distance of generalized spatially coupled ldpc codes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "spatially coupled generalized ldpc codes asymptotic analysis and finite length scaling")
  Member "spectral shape of doubly generalized ldpc codes efficient and exact evaluation":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "design of ldpc code ensembles with fast convergence properties")
  Member "approaching capacity at high rates with iterative hard decision decoding":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "lattice coding for downlink multiuser transmission")
  Member "maxwell construction the hidden bridge between iterative and maximum a posteriori decoding":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "reed muller codes theory and algorithms")
  Member "finite length scaling for iteratively decoded ldpc ensembles":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "finite length scaling of spatially coupled ldpc codes under window decoding over the bec")

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)