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 "on low complexity decoding of product codes for high throughput fiber optic systems"):
  Abstract: We study low-complexity iterative decoding algorithms for product codes. We revisit two algorithms recently proposed by the authors based on bounded distance decoding (BDD) of the component codes that improve the performance of conventional iterative BDD (iBDD). We then propose a novel decoding algorithm that is based on generalized minimum distance decoding of the component codes. The proposed algorithm closes over 50% of the performance gap between iBDD and turbo product decoding (TPD) based on the Chase-Pyndiah algorithm. Moreover, the algorithm only leads to a limited increase in complexity with respect to iBDD and has significantly lower complexity than TPD. The studied algorithms are particularly interesting for high-throughput fiber-optic communications.

Includes members:
  Member "low complexity concatenated ldpc staircase codes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "binary message passing decoding of product like codes")
  Member "iterative bounded distance decoding of product codes with scaled reliability":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on product codes with probabilistic amplitude shaping for high throughput fiber optic systems")
  Member "probabilistic amplitude shaping with hard decision decoding and staircase codes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on product codes with probabilistic amplitude shaping for high throughput fiber optic systems")
  Member "density evolution for deterministic generalized product codes with higher order modulation":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "probabilistic amplitude shaping with hard decision decoding and staircase codes")
  Member "density evolution for deterministic generalized product codes on the binary erasure channel at high rates":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "binary message passing decoding of product like codes")
  Member "terminated and tailbiting spatially coupled codes with optimized bit mappings for spectrally efficient fiber optical systems":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "analysis and optimization of tail biting spatially coupled protograph ldpc codes for bicm id systems")
  Member "a pragmatic coded modulation scheme for high spectral efficiency fiber optic communications":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "sign bit shaping using polar codes")
  Member "staircase codes fec for 100 gb s otn":
    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)