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 "a class of optimal ternary cyclic codes and their duals"):
  Abstract: Cyclic codes are a subclass of linear codes and have applications in consumer electronics, data storage systems, and communication systems as they have efficient encoding and decoding algorithms. Let $m=2\ell+1$ for an integer $\ell\geq 1$ and $\pi$ be a generator of $\gf(3^m)^*$. In this paper, a class of cyclic codes $\C_{(u,v)}$ over $\gf(3)$ with two nonzeros $\pi^{u}$ and $\pi^{v}$ is studied, where $u=(3^m+1)/2$, and $v=2\cdot 3^{\ell}+1$ is the ternary Welch-type exponent. Based on a result on the non-existence of solutions to certain equation over $\gf(3^m)$, the cyclic code $\C_{(u,v)}$ is shown to have minimal distance four, which is the best minimal distance for any linear code over $\gf(3)$ with length $3^m-1$ and dimension $3^m-1-2m$ according to the Sphere Packing bound. The duals of this class of cyclic codes are also studied.

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 "optimal ternary cyclic codes from monomials":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "two classes of p ary linear codes and their duals")
  Member "optimal ternary cyclic codes with minimum distance four and five":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "two classes of p ary linear codes and their duals")
  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")
  Member "a triple error correcting cyclic code from the gold and kasami welch apn power functions":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "constant composition codes as subcodes of 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)