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 "lattice codes achieve the capacity of common message gaussian broadcast channels with coded side information"):
  Abstract: Lattices possess elegant mathematical properties which have been previously used in the literature to show that structured codes can be efficient in a variety of communication scenarios, including coding for the additive white Gaussian noise (AWGN) channel, dirty-paper channel, Wyner-Ziv coding, coding for relay networks and so forth. We consider the family of single-transmitter multiple-receiver Gaussian channels where the source transmits a set of common messages to all the receivers (multicast scenario), and each receiver has 'coded side information', i.e., prior information in the form of linear combinations of the messages. This channel model is motivated by applications to multi-terminal networks where the nodes may have access to coded versions of the messages from previous signal hops or through orthogonal channels. The capacity of this channel is known and follows from the work of Tuncel (2006), which is based on random coding arguments. In this paper, following the approach of Erez and Zamir, we design lattice codes for this family of channels when the source messages are symbols from a finite field 'Fp' of prime size. Our coding scheme utilizes Construction A lattices designed over the same prime field 'Fp', and uses algebraic binning at the decoders to expurgate the channel code and obtain good lattice subcodes, for every possible set of linear combinations available as side information. The achievable rate of our coding scheme is a function of the size 'p' of underlying prime field, and approaches the capacity as 'p' tends to infinity.

Includes members:
  Member "capacity of coded index modulation":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "index coding with erroneous side information")
  Member "index codes for the gaussian broadcast channel using quadrature amplitude modulation":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "index coding with erroneous side information")
  Member "a lattice approach for optimal rate diverse wireless network coding":
    also connected through other hyperedges:
      (none)
  Member "lattice index coding":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "cache aided modulation for heterogeneous coded caching over a gaussian broadcast channel")
  Member "index coding with coded side information":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "code equivalences between network codes with link errors and index codes with side information errors")
  Member "lattice index codes from algebraic number fields":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "lattice coding for downlink multiuser transmission")
  Member "joint network and gelfand pinsker coding for 3 receiver gaussian broadcast channels with receiver message side information":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "layered space time index coding")
  Member "the capacity of three receiver awgn broadcast channels with receiver message side information":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "lattice index codes from algebraic number fields")

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)