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: "matrix product codes over finite commutative frobenius rings"
  Abstract: Properties of matrix product codes over finite commutative Frobenius rings are investigated. The minimum distance of matrix product codes constructed with several types of matrices is bounded in different ways. The duals of matrix product codes are also explicitly described in terms of matrix product codes.

Connected through hyperedge HE-1 (induced by source paper "do non free lcd codes over finite commutative frobenius rings exist"):
  with members:
    - "structure and performance of generalized quasi cyclic codes"
    - "euclidean and hermitian lcd mds codes"
    - "new characterization and parametrization of lcd codes"
    - "complementary dual subfield linear codes over finite fields"
    - "parameters of two classes of lcd bch codes"
    - "lcd cyclic codes over finite fields"
    - "the combinatorics of lcd codes linear programming bound and orthogonal matrices"

Connected through hyperedge HE-2 (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"
    - "decoding of matrix product codes"

Connected through hyperedge HE-3 (induced by source paper "construction of optimal hermitian self dual codes from unitary matrices"):
  with members:
    - "new constructions of mds codes with complementary duals"
    - "new mds self dual codes from generalized reed solomon codes"
    - "new mds euclidean and hermitian self dual codes over finite fields"

Connected through hyperedge HE-4 (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"
    - "decoding of matrix product codes"

Connected through hyperedge HE-5 (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"
    - "decoding of matrix product codes"
    - "linearity and complements in projective space"

Connected through hyperedge HE-6 (induced by source paper "matrix product structure of constacyclic codes over finite chain rings mathbb f _ p m u langle u e rangle"):
  with members:
    - "the gray image of constacyclic codes over the finite chain ring f_ p m u langle u k rangle"
    - "cyclic codes over mathbb f _ 2 m u langle u k rangle of oddly even length"

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

Connected through hyperedge HE-8 (induced by source paper "thresholds of random quasi abelian codes"):
  with members:
    - "cumulative distance enumerators of random codes and their thresholds"

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)