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 "design of spatially coupled ldpc codes over gf q for windowed decoding"):
  Abstract: In this paper we consider the generalization of binary spatially coupled low-density parity-check (SC-LDPC) codes to finite fields GF$(q)$, $q\geq 2$, and develop design rules for $q$-ary SC-LDPC code ensembles based on their iterative belief propagation (BP) decoding thresholds, with particular emphasis on low-latency windowed decoding (WD). We consider transmission over both the binary erasure channel (BEC) and the binary-input additive white Gaussian noise channel (BIAWGNC) and present results for a variety of $(J,K)$-regular SC-LDPC code ensembles constructed over GF$(q)$ using protographs. Thresholds are calculated using protograph versions of $q$-ary density evolution (for the BEC) and $q$-ary extrinsic information transfer analysis (for the BIAWGNC). We show that WD of $q$-ary SC-LDPC codes provides significant threshold gains compared to corresponding (uncoupled) $q$-ary LDPC block code (LDPC-BC) ensembles when the window size $W$ is large enough and that these gains increase as the finite field size $q=2^m$ increases. Moreover, we demonstrate that the new design rules provide WD thresholds that are close to capacity, even when both $m$ and $W$ are relatively small (thereby reducing decoding complexity and latency). The analysis further shows that, compared to standard flooding-schedule decoding, WD of $q$-ary SC-LDPC code ensembles results in significant reductions in both decoding complexity and decoding latency, and that these reductions increase as $m$ increases. For applications with a near-threshold performance requirement and a constraint on decoding latency, we show that using $q$-ary SC-LDPC code ensembles, with moderate $q>2$, instead of their binary counterparts results in reduced decoding complexity.

Includes members:
  Member "threshold saturation for nonbinary sc ldpc codes on the binary erasure channel":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a combinatorial methodology for optimizing non binary graph based codes theoretical analysis and applications in data storage")
  Member "spatially coupled ldpc codes constructed from protographs":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "capacity achieving spatially coupled sparse superposition codes with amp decoding")
  Member "performance comparison of ldpc block and spatially coupled codes over gf q":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "finite length construction of high performance spatially coupled codes via optimized partitioning and lifting")
  Member "nonbinary spatially coupled ldpc codes on the binary erasure channel":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a combinatorial methodology for optimizing non binary graph based codes theoretical analysis and applications in data storage")
  Member "spatially coupled ensembles universally achieve capacity under belief propagation":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "capacity achieving spatially coupled sparse superposition codes with amp decoding")
  Member "windowed decoding of protograph based ldpc convolutional codes over erasure channels":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "finite length scaling of spatially coupled ldpc codes under window decoding over the bec")
  Member "threshold saturation on channels with memory via spatial coupling":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "spatially coupled ldpc codes constructed from protographs")
  Member "spatially coupled mackay neal codes and hsu anastasopoulos codes":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "finite length scaling based on belief propagation for spatially coupled ldpc codes")

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)