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 "coding for optical communications can we approach the shannon limit with low complexity"):
  Abstract: Approaching capacity with low complexity is a very challenging task. In this paper, we review and compare three promising coding solutions to achieve that, which are suitable for future very high-throughput, low-complexity optical communications.

Includes members:
  Member "one and two bit message passing for sc ldpc codes with higher order modulation":
    also connected through other hyperedges:
      (none)
  Member "binary message passing decoding of product codes based on generalized minimum distance decoding":
    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 "binary message passing decoding of product like codes":
    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 "low complexity concatenated ldpc staircase codes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (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-4 (induced by source paper "on product codes with probabilistic amplitude shaping for high throughput fiber optic systems")
  Member "optimization of bit mapping and quantized decoding for off the shelf protograph ldpc codes with application to ieee 802 3ca":
    also connected through other hyperedges:
      (none)
  Member "energy efficient soft assisted product decoders":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "on product codes with probabilistic amplitude shaping for high throughput fiber optic systems")
  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")

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)