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 of non binary quasi cyclic ldpc codes by ace optimization"
  Abstract: An algorithm for constructing Tanner graphs of non-binary irregular quasi-cyclic LDPC codes is introduced. It employs a new method for selection of edge labels allowing control over the code's non-binary ACE spectrum and resulting in low error-floor. The efficiency of the algorithm is demonstrated by generating good codes of short to moderate length over small fields, outperforming codes generated by the known methods.

Connected through hyperedge HE-1 (induced by source paper "a combinatorial methodology for optimizing non binary graph based codes theoretical analysis and applications in data storage"):
  with members:
    - "finite length construction of high performance spatially coupled codes via optimized partitioning and lifting"
    - "spatially coupled code design for partial response channels optimal object minimization approach"
    - "a generalized algebraic approach to optimizing sc ldpc codes"
    - "high performance non binary spatially coupled codes for flash memories"
    - "threshold saturation for nonbinary sc ldpc codes on the binary erasure channel"
    - "spatially coupled ldpc codes constructed from protographs"
    - "a scaling law to predict the finite length performance of spatially coupled ldpc codes"
    - "iterative decoding of ldpc codes over the q ary partial erasure channel"

Connected through hyperedge HE-2 (induced by source paper "a finite length construction of irregular spatially coupled codes"):
  with members:
    - "finite length construction of high performance spatially coupled codes via optimized partitioning and lifting"
    - "high performance non binary spatially coupled codes for flash memories"
    - "threshold saturation for nonbinary sc ldpc codes on the binary erasure channel"
    - "spatially coupled ensembles universally achieve capacity under belief propagation"
    - "windowed decoding of spatially coupled codes"

Connected through hyperedge HE-3 (induced by source paper "finite length construction of high performance spatially coupled codes via optimized partitioning and lifting"):
  with members:
    - "high performance non binary spatially coupled codes for flash memories"
    - "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"
    - "performance comparison of ldpc block and spatially coupled codes over gf q"
    - "on characterization of elementary trapping sets of variable regular ldpc codes"
    - "spatially coupled ensembles universally achieve capacity under belief propagation"
    - "the cycle consistency matrix approach to absorbing sets in separable circulant based ldpc codes"

Connected through hyperedge HE-4 (induced by source paper "high performance non binary spatially coupled codes for flash memories"):
  with members:
    - "a combinatorial methodology for optimizing non binary graph based codes theoretical analysis and applications in data storage"
    - "spatially coupled ensembles universally achieve capacity under belief propagation"
    - "windowed decoding of protograph based ldpc convolutional codes over erasure channels"
    - "deriving good ldpc convolutional codes from ldpc block codes"

Connected through hyperedge HE-5 (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 and analysis of nonbinary ldpc codes for arbitrary discrete memoryless channels"
    - "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)