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 "the weight distributions of two classes of p ary cyclic codes with few weights"):
  Abstract: Cyclic codes have attracted a lot of research interest for decades as they have efficient encoding and decoding algorithms. In this paper, for an odd prime p, we investigate two classes of p-ary cyclic codes for special cases and determine their weight distributions explicitly. The results show that both codes have at most five nonzero weights.

Includes members:
  Member "weight distributions of cyclic codes with respect to pairwise coprime order elements":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a class of functions with low valued walsh spectrum")
  Member "a class of three weight cyclic codes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a class of narrow sense bch codes")
  Member "a family of five weight cyclic codes and their weight enumerators":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "complete weight enumerators of a class of linear codes with two or three weights")
  Member "cyclic codes from cyclotomic sequences of order four":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a sequence construction of cyclic codes over finite fields")
  Member "hamming weights in irreducible cyclic codes":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "a class of narrow sense bch 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)