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: "linear codes with two or three weights from some functions with low walsh spectrum in odd characteristic"
  Abstract: Linear codes with few weights have applications in authentication codes, secrete sharing schemes, association schemes, consumer electronics and data storage system. In this paper, several classes of linear codes with two or three weights are obtained from some functions with low Walsh spectrum in odd characteristic. Numerical results show that some of the linear codes obtained are optimal or almost optimal in the sense that they meet certain bounds on linear codes.

Connected through hyperedge HE-1 (induced by source paper "a new class of three weight linear codes from weakly regular plateaued functions"):
  with members:
    - "a class of two weight and three weight codes and their applications in secret sharing"

Connected through hyperedge HE-2 (induced by source paper "linear code derived from the primage of quadratic function"):
  with members:
    - "complete weight enumerators of a family of three weight linear codes"
    - "complete weight enumerators of some linear codes"
    - "linear codes from some 2 designs"
    - "linear codes with two or three weights from quadratic bent functions"
    - "a class of two weight and three weight codes and their applications in secret sharing"
    - "a class of three weight cyclic codes"
    - "hamming weights in irreducible cyclic codes"

Connected through hyperedge HE-3 (induced by source paper "it is indeed a fundamental construction of all linear codes"):
  with members:
    - "linear codes from some 2 designs"
    - "linear codes with two or three weights from quadratic 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"
    - "hamming weights in irreducible cyclic codes"

Connected through hyperedge HE-4 (induced by source paper "a construction of linear codes over f_ 2 t from boolean functions"):
  with members:
    - "linear codes from some 2 designs"
    - "linear codes with two or three weights from quadratic bent functions"
    - "linear codes with two or three weights from weakly regular bent functions"

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)