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 performance of rate compatible non binary ldpc convolutional codes"
  Abstract: In this paper, we present a construction method of non-binary low-density parity-check (LDPC) convolutional codes. Our construction method is an extension of Felstroem and Zigangirov construction for non-binary LDPC convolutional codes. The rate-compatibility of the non-binary convolutional code is also discussed. The proposed rate-compatible code is designed from one single mother (2,4)-regular non-binary LDPC convolutional code of rate 1/2. Higher-rate codes are produced by puncturing the mother code and lower-rate codes are produced by multiplicatively repeating the mother code. Simulation results show that non-binary LDPC convolutional codes of rate 1/2 outperform state-of-the-art binary LDPC convolutional codes with comparable constraint bit length. Also the derived low-rate and high-rate non-binary LDPC convolutional codes exhibit good decoding performance without loss of large gap to the Shannon limits.

Connected through hyperedge HE-1 (induced by source paper "threshold saturation for nonbinary sc ldpc codes on the binary erasure channel"):
  with members:
    - "threshold saturation for spatially coupled ldpc and ldgm codes on bms channels"
    - "a simple proof of maxwell saturation for coupled scalar recursions"
    - "threshold analysis of non binary spatially coupled ldpc codes with windowed decoding"
    - "nonbinary spatially coupled ldpc codes on the binary erasure channel"
    - "a proof of threshold saturation for spatially coupled ldpc codes on bms channels"
    - "thresholds of spatially coupled systems via lyapunov s method"
    - "a simple proof of threshold saturation for coupled scalar recursions"
    - "threshold saturation via spatial coupling why convolutional ldpc ensembles perform so well over the bec"

Connected through hyperedge HE-2 (induced by source paper "how to achieve the capacity of asymmetric channels"):
  with members:
    - "on the scaling exponent of polar codes for binary input energy harvesting channels"
    - "threshold saturation for nonbinary sc ldpc codes on the binary erasure channel"
    - "construction of polar codes with sublinear complexity"
    - "polar codes for broadcast channels"
    - "a scaling law to predict the finite length performance of spatially coupled ldpc codes"
    - "unified scaling of polar codes error exponent scaling exponent moderate deviations and error floors"
    - "finite length scaling for polar codes"
    - "achieving marton s region for broadcast channels using polar codes"

Connected through hyperedge HE-3 (induced by source paper "design of spatially coupled ldpc codes over gf q for windowed decoding"):
  with members:
    - "threshold saturation for nonbinary sc ldpc codes on the binary erasure channel"
    - "spatially coupled ldpc codes constructed from protographs"
    - "performance comparison of ldpc block and spatially coupled codes over gf q"
    - "nonbinary spatially coupled ldpc codes on the binary erasure channel"
    - "spatially coupled ensembles universally achieve capacity under belief propagation"
    - "windowed decoding of protograph based ldpc convolutional codes over erasure channels"
    - "threshold saturation on channels with memory via spatial coupling"
    - "spatially coupled mackay neal codes and hsu anastasopoulos codes"

Connected through hyperedge HE-4 (induced by source paper "performance comparison of ldpc block and spatially coupled codes over gf q"):
  with members:
    - "threshold saturation for nonbinary sc ldpc codes on the binary erasure channel"
    - "spatially coupled ldpc codes constructed from protographs"
    - "design of spatially coupled ldpc codes over gf q for windowed decoding"
    - "threshold analysis of non binary spatially coupled ldpc codes with windowed decoding"
    - "spatially coupled ensembles universally achieve capacity under belief propagation"
    - "windowed decoding of protograph based ldpc convolutional codes over erasure channels"
    - "threshold saturation via spatial coupling why convolutional ldpc ensembles perform so well over the bec"
    - "deriving good ldpc convolutional codes from ldpc block codes"

Connected through hyperedge HE-5 (induced by source paper "threshold analysis of non binary spatially coupled ldpc codes with windowed decoding"):
  with members:
    - "threshold saturation for nonbinary sc ldpc codes on the binary erasure channel"
    - "nonbinary spatially coupled ldpc codes on the binary erasure channel"
    - "windowed decoding of protograph based ldpc convolutional codes over erasure channels"
    - "threshold saturation via spatial coupling why convolutional ldpc ensembles perform so well over the bec"
    - "design and analysis of nonbinary ldpc codes for arbitrary discrete memoryless channels"
    - "density evolution thresholds and the stability condition for non binary ldpc codes"

Connected through hyperedge HE-6 (induced by source paper "nonbinary spatially coupled ldpc codes on the binary erasure channel"):
  with members:
    - "threshold saturation via spatial coupling why convolutional ldpc ensembles perform so well over the bec"
    - "threshold saturation on bms channels via spatial coupling"
    - "maxwell construction the hidden bridge between iterative and maximum a posteriori decoding"
    - "density evolution thresholds and the stability condition for non binary ldpc codes"

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)