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 "four dimensional coded modulation with bit wise decoders for future optical communications"):
  Abstract: Coded modulation (CM) is the combination of forward error correction (FEC) and multilevel constellations. Coherent optical communication systems result in a four-dimensional (4D) signal space, which naturally leads to 4D-CM transceivers. A practically attractive design paradigm is to use a bit-wise decoder, where the detection process is (suboptimally) separated into two steps: soft-decision demapping followed by binary decoding. In this paper, bit-wise decoders are studied from an information-theoretic viewpoint. 4D constellations with up to 4096 constellation points are considered. Metrics to predict the post-FEC bit-error rate (BER) of bit-wise decoders are analyzed. The mutual information is shown to fail at predicting the post-FEC BER of bit-wise decoders and the so-called generalized mutual information is shown to be a much more robust metric. For the suboptimal scheme under consideration, it is also shown that constellations that transmit and receive information in each polarization and quadrature independently (e.g., PM-QPSK, PM-16QAM, and PM-64QAM) outperform the best 4D constellations designed for uncoded transmission. Theoretical gains are as high as 4 dB, which are then validated via numerical simulations of low-density parity check codes.

Includes members:
  Member "high snr asymptotics of mutual information for discrete constellations with applications to bicm":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "introducing enumerative sphere shaping for optical communication systems with short blocklengths")
  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 "probabilistic signal shaping for bit metric decoding":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "achievable information rates for probabilistic amplitude shaping a minimum randomness approach via random sign coding arguments")
  Member "design of apsk constellations for coherent optical channels with nonlinear phase noise":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a signal space distance measure for nondispersive optical fiber")
  Member "signal shaping for bicm at low snr":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "broadcast coded modulation multilevel and bit interleaved construction")
  Member "general ber expression for one dimensional constellations":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "on the impact of optimal modulation and fec overhead on future optical networks")
  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 "calculation of mutual information for partially coherent gaussian channels with applications to fiber optics":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "models and information rates for wiener phase noise channels")

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)