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: "several classes of minimal linear codes with few weights from weakly regular plateaued functions"
  Abstract: Minimal linear codes have significant applications in secret sharing schemes and secure two-party computation. There are several methods to construct linear codes, one of which is based on functions over finite fields. Recently, many construction methods of linear codes based on functions have been proposed in the literature. In this paper, we generalize the recent construction methods given by Tang et al. in [IEEE Transactions on Information Theory, 62(3), 1166-1176, 2016] to weakly regular plateaued functions over finite fields of odd characteristic. We first construct three weight linear codes from weakly regular plateaued functions based on the second generic construction and determine their weight distributions. We next give a subcode with two or three weights of each constructed code as well as its parameter. We finally show that the constructed codes in this paper are minimal, which confirms that the secret sharing schemes based on their dual codes have the nice access structures.

Connected through hyperedge HE-1 (induced by source paper "a geometric characterization of minimal codes and their asymptotic performance"):
  with members:
    - "an inductive construction of minimal codes"
    - "minimal linear codes arising from blocking sets"
    - "full characterization of minimal linear codes as cutting blocking sets"
    - "group codes over fields are asymptotically good"
    - "minimal linear codes over finite fields"
    - "long quasi polycyclic t cis codes"
    - "on self dual double circulant codes"
    - "linear codes from some 2 designs"

Connected through hyperedge HE-2 (induced by source paper "strongly regular graphs from weakly regular plateaued functions"):
  with members:
    - "a new class of three weight linear codes from weakly regular plateaued 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)