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 "minimal linear codes constructed from functions"):
  Abstract: In this paper, we consider minimal linear codes in a general construction of linear codes from q-ary functions. First, we give the sufficient and necessary condition for codewords to be minimal. Second, as an application, we present two constructions of minimal linear codes which contained some recent results as special cases.

Includes members:
  Member "the parameters of minimal linear codes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "full characterization of minimal linear codes as cutting blocking sets")
  Member "minimal linear codes from characteristic functions":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "full characterization of minimal linear codes as cutting blocking sets")
  Member "minimal linear codes over finite fields":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a geometric characterization of minimal codes and their asymptotic performance")
  Member "two new families of two weight codes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "the parameters of minimal linear codes")
  Member "complete weight enumerators of a family of three weight linear codes":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "a class of cyclotomic linear codes and their generalized hamming weights")
  Member "a construction of binary linear codes from boolean functions":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "several classes of two weight and three weight linear codes")
  Member "linear codes from a generic construction":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "the parameters of minimal linear codes")
  Member "linear codes from some 2 designs":
    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)