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 "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.

Includes members:
  Member "a class of three weight linear codes and their complete weight enumerators":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "complete weight enumerators of two classes of linear codes")
  Member "complete weight enumerators of a family of three weight linear codes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "minimal linear codes constructed from functions")
  Member "complete weight enumerators of some linear codes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "complete weight enumerators of a family of three weight linear codes")
  Member "complete weight enumerators of two classes of linear codes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "complete weight enumerators of a class of linear codes with two or three weights")
  Member "linear codes from some 2 designs":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "weight distributions and weight hierarchies of two classes of binary linear codes")
  Member "a class of three weight and five weight linear codes":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "several classes of two weight and three weight linear codes")
  Member "a class of linear codes with three weights":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "a class of linear codes with a few weights")
  Member "a class of two weight and three weight codes and their applications in secret sharing":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "weight distributions and weight hierarchies of two classes of binary linear codes")

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)