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 "evaluation of the weight distribution of a class of linear codes based on semi primitive gauss sums"):
  Abstract: Linear codes with a few weights have been widely investigated in recent years. However, most of these known linear codes were defined over a prime field. In this paper, we mainly use Gauss sums to represent the Hamming weights of a class of $q$-ary linear codes, where $q$ is a power of a prime. The lower bound of the minimum Hamming distance of the codes is obtained. And in some special cases, we evaluate the weight distributions of the linear codes based on semi-primitive Gauss sums and obtain some one-weight, two-weight linear codes. It is quite interesting that we find a few optimal codes achieving some certain bounds on linear codes. The linear codes in this paper can be used in secret sharing schemes, authentication codes and data storage systems.

Includes members:
  Member "a construction of binary linear codes from boolean functions":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "minimal linear codes constructed from functions")
  Member "linear codes from a generic construction":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "minimal linear codes constructed from functions")
  Member "linear codes from some 2 designs":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "weight distributions and weight hierarchies of two classes of binary linear codes")
  Member "a class of two weight and three weight codes and their applications in secret sharing":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "weight distributions and weight hierarchies of two classes of binary linear codes")
  Member "five families of three weight ternary cyclic codes and their duals":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "complete weight enumerators of a family of three weight 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)