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 "replacing the soft fec limit paradigm in the design of optical communication systems"):
  Abstract: The FEC limit paradigm is the prevalent practice for designing optical communication systems to attain a certain bit-error rate (BER) without forward error correction (FEC). This practice assumes that there is an FEC code that will reduce the BER after decoding to the desired level. In this paper, we challenge this practice and show that the concept of a channel-independent FEC limit is invalid for soft-decision bit-wise decoding. It is shown that for low code rates and high order modulation formats, the use of the soft FEC limit paradigm can underestimate the spectral efficiencies by up to 20%. A better predictor for the BER after decoding is the generalized mutual information, which is shown to give consistent post-FEC BER predictions across different channel conditions and modulation formats. Extensive optical full-field simulations and experiments are carried out in both the linear and nonlinear transmission regimes to confirm the theoretical analysis.

Includes members:
  Member "four dimensional coded modulation with bit wise decoders for future optical communications":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "introducing enumerative sphere shaping for optical communication systems with short blocklengths")
  Member "high snr asymptotics of mutual information for discrete constellations with applications to bicm":
    also connected through other hyperedges:
      - Hyperedge HE-2 (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-3 (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 "on the information loss of the max log approximation in bicm systems":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "performance metrics for systems with soft decision fec and probabilistic shaping")
  Member "probabilistic signal shaping for bit metric decoding":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "achievable information rates for probabilistic amplitude shaping a minimum randomness approach via random sign coding arguments")
  Member "achievable rates for four dimensional coded modulation with a bit wise receiver":
    also connected through other hyperedges:
      (none)
  Member "on the exact ber of bit wise demodulators for one dimensional constellations":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "asymptotic comparison of ml and map detectors for multidimensional constellations")
  Member "spatially coupled ensembles universally achieve capacity under belief propagation":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "capacity achieving spatially coupled sparse superposition codes with amp decoding")

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)