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 "an experimental comparison of coded modulation strategies for 100 gb s transceivers"):
  Abstract: Coded modulation is a key technique to increase the spectral efficiency of coherent optical communication systems. Two popular strategies for coded modulation are turbo trellis-coded modulation (TTCM) and bit-interleaved coded modulation (BICM) based on low-density parity-check (LDPC) codes. Although BICM LDPC is suboptimal, its simplicity makes it very popular in practice. In this work, we compare the performance of TTCM and BICM LDPC using information-theoretic measures. Our information-theoretic results show that for the same overhead and modulation format only a very small penalty (less than 0.1 dB) is to be expected when an ideal BICM LDPC scheme is used. However, the results obtained for the coded modulation schemes implemented in this paper show that the TTCM outperforms BICM LDPC by a larger margin. For a 1000 km transmission at 100 Gb/s, the observed gain was 0.4 dB.

Includes members:
  Member "performance prediction of nonbinary forward error correction in optical transmission experiments":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "achievable information rates for coded modulation with hard decision decoding for coherent fiber optic systems")
  Member "impact of 4d channel distribution on the achievable rates in coherent optical communication experiments":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "nonlinearity mitigation in wdm systems models strategies and achievable rates")
  Member "on the impact of optimal modulation and fec overhead on future optical networks":
    also connected through other hyperedges:
      (none)

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)