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: "complete weight enumerators of two classes of linear codes"
  Abstract: Recently, linear codes with few weights have been constructed and extensively studied. In this paper, for an odd prime p, we determined the complete weight enumerator of two classes of p-ary linear codes constructed from defining set. Results show that the codes are at almost seven-weight linear codes and they may have applications in secret sharing schemes.

Connected through hyperedge HE-1 (induced by source paper "complete weight enumerators of a class of linear codes with two or three weights"):
  with members:
    - "a construction of linear codes and their complete weight enumerators"
    - "the weight distributions of two classes of p ary cyclic codes with few weights"
    - "linear codes from some 2 designs"
    - "a class of two weight and three weight codes and their applications in secret sharing"
    - "a family of five weight cyclic codes and their weight enumerators"

Connected through hyperedge HE-2 (induced by source paper "complete weight distribution and macwilliams identities for asymmetric quantum codes"):
  with members:
    - "linear programming bounds for entanglement assisted quantum error correcting codes by split weight enumerators"
    - "a construction of linear codes and their complete weight enumerators"
    - "the weight distributions of two classes of p ary cyclic codes with few weights"
    - "weight distributions of cyclic codes with respect to pairwise coprime order elements"

Connected through hyperedge HE-3 (induced by source paper "a construction of linear codes and their complete weight enumerators"):
  with members:
    - "a class of three weight linear codes and their complete weight enumerators"
    - "complete weight enumerators of a family of three weight linear codes"
    - "complete weight enumerators of some linear codes"
    - "linear codes from some 2 designs"
    - "a class of three weight and five weight linear codes"
    - "a class of linear codes with three weights"
    - "a class of two weight and three weight codes and their applications in secret sharing"

Connected through hyperedge HE-4 (induced by source paper "a class of three weight linear codes and their complete weight enumerators"):
  with members:
    - "complete weight enumerators of a family of three weight linear codes"
    - "linear codes from some 2 designs"
    - "linear codes with two or three weights from weakly regular bent functions"
    - "a class of two weight and three weight codes and their applications in secret sharing"
    - "a family of five weight cyclic codes and their weight enumerators"
    - "hamming weights in irreducible cyclic codes"
    - "the weight distributions of cyclic codes and elliptic curves"

Connected through hyperedge HE-5 (induced by source paper "further factorization of x n 1 over a finite field"):
  with members:
    - "a construction of linear codes and their complete weight enumerators"
    - "the weight distributions of two classes of p ary cyclic codes with few weights"
    - "weight distributions of cyclic codes with respect to pairwise coprime order elements"

Connected through hyperedge HE-6 (induced by source paper "on some exponential sums related to the coulter s polynomial"):
  with members:
    - "on the dual of the coulter matthews bent functions"
    - "linear codes with two or three weights from weakly regular bent functions"
    - "a class of two weight and three weight codes and their applications in secret sharing"

Connected through hyperedge HE-7 (induced by source paper "on the complete weight enumerators of some linear codes with a few weights"):
  with members:
    - "a class of two weight and three weight codes and their applications in secret sharing"

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)