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 "on the design of multi dimensional irregular repeat accumulate lattice codes"):
  Abstract: Most multi-dimensional (more than two dimensions) lattice partitions only form additive quotient groups and lack multiplication operations. This prevents us from constructing lattice codes based on multi-dimensional lattice partitions directly from non-binary linear codes over finite fields. In this paper, we design lattice codes from Construction A lattices where the underlying linear codes are non-binary irregular repeat-accumulate (IRA) codes. Most importantly, our codes are based on multi-dimensional lattice partitions with finite constellations. We propose a novel encoding structure that adds randomly generated lattice sequences to the encoder's messages, instead of multiplying lattice sequences to the encoder's messages. We prove that our approach can ensure that the decoder's messages exhibit permutation-invariance and symmetry properties. With these two properties, the densities of the messages in the iterative decoder can be modeled by Gaussian distributions described by a single parameter. With Gaussian approximation, extrinsic information transfer (EXIT) charts for our multi-dimensional IRA lattice codes are developed and used for analyzing the convergence behavior and optimizing the decoding thresholds. Simulation results show that our codes can approach the unrestricted Shannon limit within 0.46 dB and outperform the previously designed lattice codes with two-dimensional lattice partitions and existing lattice coding schemes for large codeword length.

Includes members:
  Member "leech constellations of construction a lattices":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "lattice coding for downlink multiuser transmission")
  Member "lattice partition multiple access a new method of downlink non orthogonal multiuser transmissions":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "lattice coding for downlink multiuser transmission")
  Member "construction of full diversity ldpc lattices for block fading channels":
    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 "construction a of lattices over number fields and block fading wiretap coding":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "lattice coding for downlink multiuser transmission")
  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 "lattices over eisenstein integers for compute and forward":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "lattice coding for downlink multiuser transmission")
  Member "low density lattice codes":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "neural fuzzy extractors a secure way to use artificial neural networks for biometric user authentication")

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)