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: "structure and performance of generalized quasi cyclic codes"
  Abstract: Generalized quasi-cyclic (GQC) codes form a natural generalization of quasi-cyclic (QC) codes. They are viewed here as mixed alphabet codes over a family of ring alphabets. Decomposing these rings into local rings by the Chinese Remainder Theorem yields a decomposition of GQC codes into a sum of concatenated codes. This decomposition leads to a trace formula, a minimum distance bound, and to a criteria for the GQC code to be self-dual or to be linear complementary dual (LCD). Explicit long GQC codes that are LCD, but not QC, are exhibited.

Connected through hyperedge HE-1 (induced by source paper "do non free lcd codes over finite commutative frobenius rings exist"):
  with members:
    - "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"
    - "matrix product codes over finite commutative frobenius rings"

Connected through hyperedge HE-2 (induced by source paper "euclidean and hermitian lcd mds codes"):
  with members:
    - "on mds negacyclic lcd codes"
    - "on hermitian lcd codes from cyclic codes and their applications to orthogonal direct sum masking"
    - "some bounds on binary lcd codes"
    - "new constructions of mds codes with complementary duals"
    - "complementary dual subfield linear codes over finite fields"
    - "complementary dual algebraic geometry codes"
    - "parameters of two classes of lcd bch codes"
    - "matrix product complementary dual codes"

Connected through hyperedge HE-3 (induced by source paper "on sigma lcd codes"):
  with members:
    - "on hermitian lcd codes from cyclic codes and their applications to orthogonal direct sum masking"
    - "linear codes over fq which are equivalent to lcd codes"
    - "euclidean and hermitian lcd mds codes"
    - "new characterization and parametrization of lcd codes"
    - "galois lcd codes over finite fields"
    - "complementary dual subfield linear codes over finite fields"
    - "complementary dual algebraic geometry codes"
    - "parameters of two classes of lcd bch codes"

Connected through hyperedge HE-4 (induced by source paper "linear codes over fq which are equivalent to lcd codes"):
  with members:
    - "algebraic geometry codes with complementary duals exceed the asymptotic gilbert varshamov bound"
    - "on hermitian lcd codes from cyclic codes and their applications to orthogonal direct sum masking"
    - "some bounds on binary lcd codes"
    - "euclidean and hermitian lcd mds codes"
    - "complementary dual subfield linear codes over finite fields"
    - "complementary dual algebraic geometry codes"
    - "parameters of two classes of lcd bch codes"
    - "matrix product complementary dual 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)