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 "binary message passing decoding of product codes based on generalized minimum distance decoding"):
  Abstract: We propose a binary message passing decoding algorithm for product codes based on generalized minimum distance decoding (GMDD) of the component codes, where the last stage of the GMDD makes a decision based on the Hamming distance metric. The proposed algorithm closes half of the gap between conventional iterative bounded distance decoding (iBDD) and turbo product decoding based on the Chase--Pyndiah algorithm, at the expense of some increase in complexity. Furthermore, the proposed algorithm entails only a limited increase in data flow compared to iBDD.

Includes members:
  Member "binary message passing decoding of product like codes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on product codes with probabilistic amplitude shaping for high throughput fiber optic systems")
  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 "on low complexity decoding of product codes for high throughput fiber optic systems":
    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 "energy efficient soft assisted product decoders":
    also connected through other hyperedges:
      - Hyperedge HE-4 (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 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 "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 "approaching capacity at high rates with iterative hard decision decoding":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "lattice coding for downlink multiuser transmission")
  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)