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 sequence construction of cyclic codes over finite fields"):
  Abstract: Due to their efficient encoding and decoding algorithms, cyclic codes, a subclass of linear codes, have applications in communication systems, consumer electronics, and data storage systems. There are several approaches to constructing all cyclic codes over finite fields, including the generator matrix approach, the generator polynomial approach, and the generating idempotent approach. Another one is a sequence approach, which has been intensively investigated in the past decade. The objective of this paper is to survey the progress in this direction in the past decade. Many open problems are also presented in this paper.

Includes members:
  Member "the dimension and minimum distance of two classes of primitive bch codes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a class of narrow sense bch codes")
  Member "a note on cyclic codes from apn functions":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "cyclic codes from dickson polynomials")
  Member "cyclic codes from dickson polynomials":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "cyclic codes from two prime generalized cyclotomic sequences of order 6")
  Member "cyclic codes from cyclotomic sequences of order four":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "the weight distributions of two classes of p ary cyclic codes with few weights")

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)