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: "decoding of matrix product codes"
  Abstract: We propose a decoding algorithm for the (u | u + v)-construction that decodes up to half of the minimum distance of the linear code. We extend this algorithm for a class of matrix-product codes in two different ways. In some cases, one can decode beyond the error-correction capability of the code.

Connected through hyperedge HE-1 (induced by source paper "lcd matrix product codes over commutative rings"):
  with members:
    - "on self orthogonality and self duality of matrix product codes over commutative rings"
    - "matrix product codes over commutative rings and constructions arising from sigma delta codes"
    - "matrix product complementary dual codes"
    - "lcd cyclic codes over finite fields"
    - "the combinatorics of lcd codes linear programming bound and orthogonal matrices"
    - "new quantum codes from evaluation and matrix product codes"
    - "matrix product codes over finite commutative frobenius rings"

Connected through hyperedge HE-2 (induced by source paper "on self orthogonality and self duality of matrix product codes over commutative rings"):
  with members:
    - "new quantum codes from evaluation and matrix product codes"
    - "matrix product codes over finite commutative frobenius rings"

Connected through hyperedge HE-3 (induced by source paper "galois hulls of linear codes over finite fields"):
  with members:
    - "on sigma lcd codes"
    - "constructions of optimal lcd codes over large finite fields"
    - "euclidean and hermitian lcd mds codes"
    - "galois lcd codes over finite fields"
    - "new constructions of mds codes with complementary duals"
    - "complementary dual subfield linear codes over finite fields"
    - "matrix product codes over finite commutative frobenius rings"
    - "linearity and complements in projective space"

Connected through hyperedge HE-4 (induced by source paper "fast algorithms for the computation of the minimum distance of a random linear code"):
  with members:
    - "relative generalized hamming weights of one point algebraic geometric codes"
    - "list decoding of matrix product codes from nested codes an application to quasi cyclic codes"
    - "new linear codes from matrix product codes with polynomial units"

Connected through hyperedge HE-5 (induced by source paper "new quantum codes from evaluation and matrix product codes"):
  with members:
    - "quantum codes from affine variety codes and their subfield subcodes"
    - "list decoding of matrix product codes from nested codes an application to quasi cyclic codes"
    - "new linear codes from matrix product codes with polynomial units"
    - "on the structure of generalized toric codes"

Connected through hyperedge HE-6 (induced by source paper "matrix product codes over finite commutative frobenius rings"):
  with members:
    - "list decoding of matrix product codes from nested codes an application to quasi cyclic codes"
    - "new linear codes from matrix product codes with polynomial units"

Connected through hyperedge HE-7 (induced by source paper "homogeneous weights of matrix product codes over finite principal ideal rings"):
  with members:
    - "matrix product codes over finite commutative frobenius rings"
    - "new linear codes from matrix product codes with polynomial units"

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)