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 "approaching capacity at high rates with iterative hard decision decoding"):
  Abstract: A variety of low-density parity-check (LDPC) ensembles have now been observed to approach capacity with message-passing decoding. However, all of them use soft (i.e., non-binary) messages and a posteriori probability (APP) decoding of their component codes. In this paper, we show that one can approach capacity at high rates using iterative hard-decision decoding (HDD) of generalized product codes. Specifically, a class of spatially-coupled GLDPC codes with BCH component codes is considered, and it is observed that, in the high-rate regime, they can approach capacity under the proposed iterative HDD. These codes can be seen as generalized product codes and are closely related to braided block codes. An iterative HDD algorithm is proposed that enables one to analyze the performance of these codes via density evolution (DE).

Includes members:
  Member "density evolution for deterministic generalized product codes on the binary erasure channel at high rates":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "binary message passing decoding of product like codes")
  Member "deterministic and ensemble based spatially coupled product codes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "asymptotic analysis and spatial coupling of counter braids")
  Member "a simple proof of maxwell saturation for coupled scalar recursions":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "capacity achieving spatially coupled sparse superposition codes with amp decoding")
  Member "threshold saturation in spatially coupled constraint satisfaction problems":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "universal sparse superposition codes with spatial coupling and gamp decoding")
  Member "a simple proof of threshold saturation for coupled scalar recursions":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "peeling close to the orientability threshold spatial coupling in hashing based data structures")
  Member "staircase codes fec for 100 gb s otn":
    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 "wave like solutions of general one dimensional spatially coupled systems":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "the velocity of the propagating wave for spatially coupled systems with applications to ldpc codes")
  Member "threshold saturation via spatial coupling why convolutional ldpc ensembles perform so well over the bec":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "capacity achieving spatially coupled sparse superposition codes with amp decoding")

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)