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: "a construction of linear codes and their complete weight enumerators"
  Abstract: Recently, linear codes constructed from defining sets have been studied extensively. They may have nice parameters if the defining set is chosen properly. Let $ m >2$ be a positive integer. For an odd prime $ p $, let $ r=p^m $ and $\text{Tr}$ be the absolute trace function from $\mathbb{F}_r$ onto $\mathbb{F}_p$. In this paper, we give a construction of linear codes by defining the code $ C_{D}=\{(\mathrm{Tr}(ax))_{x\in D}: a \in \mathbb{F}_{r} \}, $ where $ D =\left\{x\in \mathbb{F}_{r} : \mathrm{Tr}(x)=1, \mathrm{Tr}(x^2)=0 \right\}. $ Its complete weight enumerator and weight enumerator are determined explicitly by employing cyclotomic numbers and Gauss sums. In addition, we obtain several optimal linear codes with a few weights. They have higher rate compared with other codes, which enables them to have essential applications in areas such as association schemes and 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:
    - "the weight distributions of two classes of p ary cyclic codes with few weights"
    - "complete weight enumerators of two classes of linear codes"
    - "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"
    - "the weight distributions of two classes of p ary cyclic codes with few weights"
    - "complete weight enumerators of two classes of linear codes"
    - "weight distributions of cyclic codes with respect to pairwise coprime order elements"

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

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)