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 "exit chart analysis of block markov superposition transmission of short codes"):
  Abstract: In this paper, a modified extrinsic information transfer (EXIT) chart analysis that takes into account the relation between mutual information (MI) and bit-error-rate (BER) is presented to study the convergence behavior of block Markov superposition transmission (BMST) of short codes (referred to as basic codes). We show that the threshold curve of BMST codes using an iterative sliding window decoding algorithm with a fixed decoding delay achieves a lower bound in the high signal-to-noise ratio (SNR) region, while in the low SNR region, due to error propagation, the thresholds of BMST codes become slightly worse as the encoding memory increases. We also demonstrate that the threshold results are consistent with finite-length performance simulations.

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 analysis of block markov superposition transmission of short codes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "statistical learning aided list decoding of semi random block oriented convolutional codes")
  Member "a new class of multiple rate codes based on block markov superposition transmission":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "statistical learning aided list decoding of semi random block oriented convolutional codes")
  Member "design of spatially coupled ldpc codes over gf q for windowed decoding":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "finite length construction of high performance spatially coupled codes via optimized partitioning and lifting")
  Member "performance comparison of ldpc block and spatially coupled codes over gf q":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "finite length construction of high performance spatially coupled codes via optimized partitioning and lifting")
  Member "block markov superposition transmission construction of big convolutional codes from short codes":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "compressed coding amp based decoding and analog spatial coupling")
  Member "spatially coupled ensembles universally achieve capacity under belief propagation":
    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)