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 "advances in detection and error correction for coherent optical communications regular irregular and spatially coupled ldpc code designs"):
  Abstract: In this chapter, we show how the use of differential coding and the presence of phase slips in the transmission channel affect the total achievable information rates and capacity of a system. By means of the commonly used QPSK modulation, we show that the use of differential coding does not decrease the total amount of reliably conveyable information over the channel. It is a common misconception that the use of differential coding introduces an unavoidable differential loss. This perceived differential loss is rather a consequence of simplified differential detection and decoding at the receiver. Afterwards, we show how capacity-approaching coding schemes based on LDPC and spatially coupled LDPC codes can be constructed by combining iterative demodulation and decoding. For this, we first show how to modify the differential decoder to account for phase slips and then how to use this modified differential decoder to construct good LDPC codes. This construction method can serve as a blueprint to construct good and practical LDPC codes for other applications with iterative detection, such as higher order modulation formats with non-square constellations, multi-dimensional optimized modulation formats, turbo equalization to mitigate ISI (e.g., due to nonlinearities) and many more. Finally, we introduce the class of spatially coupled (SC)-LDPC codes, which are a generalization of LDPC codes with some outstanding properties and which can be decoded with a very simple windowed decoder. We show that the universal behavior of spatially coupled codes makes them an ideal candidate for iterative differential demodulation/detection and decoding.

Includes members:
  Member "spatially coupled sparse codes on graphs theory and practice":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "finite length scaling of spatially coupled ldpc codes under window decoding over the bec")
  Member "improving soft fec performance for higher order modulations via optimized bit channel mappings":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "optimization of bit mapping and quantized decoding for off the shelf protograph ldpc codes with application to ieee 802 3ca")
  Member "on the convergence speed of spatially coupled ldpc ensembles":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "spatially coupled ldpc codes with non uniform coupling for improved decoding speed")
  Member "spatially coupled ensembles universally achieve capacity under belief propagation":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "capacity achieving spatially coupled sparse superposition codes with amp decoding")
  Member "a pragmatic coded modulation scheme for high spectral efficiency fiber optic communications":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "sign bit shaping using polar codes")
  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 "staircase codes fec for 100 gb s otn":
    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")
  Member "analysis and design of binary message passing decoders":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "protograph based decoding of ldpc codes with hamming weight amplifiers")

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)