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 "systematic block markov superposition transmission of repetition codes"):
  Abstract: In this paper, we propose systematic block Markov superposition transmission of repetition~(BMST-R) codes, which can support a wide range of code rates but maintain essentially the same encoding/decoding hardware structure. The systematic BMST-R codes resemble the classical rate-compatible punctured convolutional~(RCPC) codes, except that they are typically non-decodable by the Viterbi algorithm due to the huge constraint length induced by the block-oriented encoding process. The information sequence is partitioned equally into blocks and transmitted directly, while their replicas are interleaved and transmitted in a block Markov superposition manner. By taking into account that the codes are systematic, we derive both upper and lower bounds on the bit-error-rate~(BER) under maximum {\em a posteriori}~(MAP) decoding. The derived lower bound reveals connections among BER, encoding memory and code rate, which provides a way to design good systematic BMST-R codes and also allows us to make trade-offs among efficiency, performance and complexity. Numerical results show that:~1)~the proposed bounds are tight in the high signal-to-noise ratio~(SNR) region;~2)~systematic BMST-R codes perform well in a wide range of code rates, and~3)~systematic BMST-R codes outperform spatially coupled low-density parity-check~(SC-LDPC) codes under an equal decoding latency constraint.

Includes members:
  Member "performance analysis of block markov superposition transmission of short codes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (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-2 (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-3 (induced by source paper "finite length construction of high performance spatially coupled codes via optimized partitioning and lifting")
  Member "threshold saturation for spatially coupled ldpc and ldgm codes on bms channels":
    also connected through other hyperedges:
      - Hyperedge HE-4 (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-5 (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-6 (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-7 (induced by source paper "capacity achieving spatially coupled sparse superposition codes with amp decoding")
  Member "lossy source coding via spatially coupled ldgm ensembles":
    also connected through other hyperedges:
      - Hyperedge HE-8 (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)