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 "broadcast coded modulation multilevel and bit interleaved construction"):
  Abstract: The capacity of the AWGN broadcast channel is achieved by superposition coding, but superposition of individual coded modulations expands the modulation alphabet and distorts its configuration. Coded modulation over a broadcast channel subject to a specific channel-input modulation constraint remains an important open problem. Some progress has been made in the related area of unequal-error protection modulations which can be considered single-user broadcast transmission, but it does not approach all points on the boundary of the capacity region. This paper studies broadcast coded modulation using multilevel coding (MLC) subject to a specific channel input constellation. The conditions under which multilevel codes can achieve the constellation-constrained capacity of the AWGN broadcast channel are derived. For any given constellation, we propose a pragmatic multilevel design technique with near constellation-constrained-capacity performance where the coupling of the superposition inner and outer codes are localized to each bit-level. It is shown that this can be further relaxed to a code coupling on only one bit level, with little or no penalty under natural labeling. The rate allocation problem between the bit levels of the two users is studied and a pragmatic method is proposed, again with near-capacity performance. In further pursuit of lower complexity, a hybrid MLC-BICM is proposed, whose performance is shown to be very close to the boundary of the constellation-constrained capacity region. Simulation results show that good point-to-point LDPC codes produce excellent performance in the proposed coded modulation framework.

Includes members:
  Member "symmetrical multilevel diversity coding and subset entropy inequalities":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "multilevel diversity coding with secure regeneration separate coding achieves the mbr point")
  Member "multilevel coding schemes for compute and forward with flexible decoding":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "compute compress and forward exploiting asymmetry of wireless relay networks")
  Member "signal shaping for bicm at low snr":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "four dimensional coded modulation with bit wise decoders for future optical communications")
  Member "asymmetric multilevel diversity coding and asymmetric gaussian multiple descriptions":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "multilevel diversity coding with secure regeneration separate coding achieves the mbr point")

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)