human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "design and analysis of nonbinary ldpc codes for arbitrary discrete memoryless channels"
  Abstract: We present an analysis under the iterative decoding of coset low-density parity-check (LDPC) codes over GF(q), designed for use over arbitrary discrete-memoryless channels (particularly nonbinary and asymmetric channels). We use a random- coset analysis to produce an effect that is similar to output symmetry with binary channels. We show that the random selection of the nonzero elements of the GF(q) parity-check matrix induces a permutation-invariance property on the densities of the decoder messages, which simplifies their analysis and approximation. We generalize several properties, including symmetry and stability from the analysis of binary LDPC codes. We show that under a Gaussian approximation, the entire q-1-dimensional distribution of the vector messages is described by a single scalar parameter (like the distributions of binary LDPC messages). We apply this property to develop extrinsic information transfer (EXIT) charts for our codes. We use appropriately designed signal constellations to obtain substantial shaping gains. Simulation results indicate that our codes outperform multilevel codes at short block lengths. We also present simulation results for the additive white Gaussian noise (AWGN) channel, including results within 0.56 dB of the unrestricted Shannon limit (i.e., not restricted to any signal constellation) at a spectral efficiency of 6 bits/s/Hz.

Connected through hyperedge HE-1 (induced by source paper "lattice coding for downlink multiuser transmission"):
  with members:
    - "downlink non orthogonal multiple access without sic for block fading channels an algebraic rotation approach"
    - "joint pilot and payload power control for uplink mimo noma with mrc sic receivers"
    - "short packet downlink transmission with non orthogonal multiple access"
    - "a multi beam noma framework for hybrid mmwave systems"
    - "optimal resource allocation for power efficient mc noma with imperfect channel state information"
    - "improved decoding and error floor analysis of staircase codes"
    - "performance analysis of a hybrid downlink uplink cooperative noma scheme"
    - "on non orthogonal multiple access with finite alphabet inputs in z channels"

Connected through hyperedge HE-2 (induced by source paper "design and decoding of polar codes for the gaussian multiple access channel"):
  with members:
    - "list decoding of polar codes"
    - "polar codes for the two user multiple access channel"
    - "how to construct polar codes"

Connected through hyperedge HE-3 (induced by source paper "repeat accumulate signal codes"):
  with members:
    - "on the design of multi dimensional irregular repeat accumulate lattice codes"
    - "leech constellations of construction a lattices"
    - "turbo lattices construction and error decoding performance"
    - "threshold improvement of low density lattice codes via spatial coupling"

Connected through hyperedge HE-4 (induced by source paper "on the design of multi dimensional irregular repeat accumulate lattice codes"):
  with members:
    - "leech constellations of construction a lattices"
    - "lattice partition multiple access a new method of downlink non orthogonal multiuser transmissions"
    - "construction of full diversity ldpc lattices for block fading channels"
    - "lattice index coding"
    - "construction a of lattices over number fields and block fading wiretap coding"
    - "lattice index codes from algebraic number fields"
    - "lattices over eisenstein integers for compute and forward"
    - "low density lattice codes"

Connected through hyperedge HE-5 (induced by source paper "attaining capacity with algebraic geometry codes through the u u v construction and koetter vardy soft decoding"):
  with members:
    - "finite length scaling for polar codes"
    - "performance limits and practical decoding of interleaved reed solomon polar concatenated codes"
    - "polar codes speed of polarization and polynomial gap to capacity"
    - "concatenated polar codes"
    - "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels"

Connected through hyperedge HE-6 (induced by source paper "ldpc codes over the q ary multi bit channel"):
  with members:
    - "erasure correction of scalar codes in the presence of stragglers"
    - "iterative decoding of ldpc codes over the q ary partial erasure channel"
    - "design of non binary quasi cyclic ldpc codes by ace optimization"
    - "density evolution thresholds and the stability condition for non binary ldpc codes"

Connected through hyperedge HE-7 (induced by source paper "ultra sparse non binary ldpc codes for probabilistic amplitude shaping"):
  with members:
    - "probabilistic shaping and non binary codes"
    - "protograph based ldpc code design for shaped bit metric decoding"

Connected through hyperedge HE-8 (induced by source paper "comparison of geometric and probabilistic shaping with application to atsc 3 0"):
  with members:
    - "design of robust protograph based ldpc codes for rate adaptation via probabilistic shaping"
    - "approaching the gaussian channel capacity with apsk constellations"
    - "constant composition distribution matching"
    - "constellation design for transmission over nonlinear satellite channels"
    - "constellation shaping for bit interleaved ldpc coded apsk"

Question: Please tell me which class the center node 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)