human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "do non free lcd codes over finite commutative frobenius rings exist"):
  Abstract: In this paper, we clarify some aspects on LCD codes in the literature. We first prove that a non-free LCD code does not exist over finite commutative Frobenius local rings. We then obtain a necessary and sufficient condition for the existence of LCD code over finite commutative Frobenius rings. We later show that a free constacyclic code over finite chain ring is LCD if and only if it is reversible, and also provide a necessary and sufficient condition for a constacyclic code to be reversible over finite chain rings. We illustrate the minimum Lee-distance of LCD codes over some finite commutative chain rings and demonstrate the results with examples. We also got some new optimal $\mathbb{Z}_4$ codes of different lengths {which are} cyclic LCD codes over $\mathbb{Z}_4$.

Includes members:
  Member "structure and performance of generalized quasi cyclic codes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "euclidean and hermitian lcd mds codes")
  Member "euclidean and hermitian lcd mds codes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "galois hulls of mds codes and their quantum error correction")
  Member "new characterization and parametrization of lcd codes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "galois hulls of mds codes and their quantum error correction")
  Member "complementary dual subfield linear codes over finite fields":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "galois hulls of linear codes over finite fields")
  Member "parameters of two classes of lcd bch codes":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "some binary bch codes with length n 2 m 1")
  Member "lcd cyclic codes over finite fields":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "self reciprocal and self conjugate reciprocal irreducible factors of x n lambda and their applications")
  Member "the combinatorics of lcd codes linear programming bound and orthogonal matrices":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "binary lcd codes from mathbb z _2 mathbb z _2 u")
  Member "matrix product codes over finite commutative frobenius rings":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "lcd matrix product codes over commutative rings")

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