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: "cyclic codes from cyclotomic sequences of order four"
  Abstract: Cyclic codes are an interesting subclass of linear codes and have been used in consumer electronics, data transmission technologies, broadcast systems, and computer applications due to their efficient encoding and decoding algorithms. In this paper, three cyclotomic sequences of order four are employed to construct a number of classes of cyclic codes over $\gf(q)$ with prime length. Under certain conditions lower bounds on the minimum weight are developed. Some of the codes obtained are optimal or almost optimal. In general, the cyclic codes constructed in this paper are very good. Some of the cyclic codes obtained in this paper are closely related to almost difference sets and difference sets. As a byproduct, the $p$-rank of these (almost) difference sets are computed.

Connected through hyperedge HE-1 (induced by source paper "the weight distributions of two classes of p ary cyclic codes with few weights"):
  with members:
    - "weight distributions of cyclic codes with respect to pairwise coprime order elements"
    - "a class of three weight cyclic codes"
    - "a family of five weight cyclic codes and their weight enumerators"
    - "hamming weights in irreducible cyclic codes"

Connected through hyperedge HE-2 (induced by source paper "a sequence construction of cyclic codes over finite fields"):
  with members:
    - "the dimension and minimum distance of two classes of primitive bch codes"
    - "a note on cyclic codes from apn functions"
    - "cyclic codes from dickson polynomials"

Connected through hyperedge HE-3 (induced by source paper "another q polynomial approach to cyclic codes"):
  with members:
    - "hamming weights in irreducible cyclic codes"

Connected through hyperedge HE-4 (induced by source paper "cyclic codes from two prime generalized cyclotomic sequences of order 6"):
  with members:
    - "the weight enumerator of three families of cyclic codes"
    - "a class of three weight cyclic codes"
    - "a family of five weight cyclic codes and their weight enumerators"
    - "cyclic code from the first class whiteman s generalized cyclotomic sequence with order 4"
    - "cyclic codes from dickson polynomials"
    - "cyclic codes from apn and planar functions"
    - "hamming weights in irreducible cyclic codes"
    - "cyclotomic constructions of cyclic codes with length being the product of two primes"

Connected through hyperedge HE-5 (induced by source paper "cyclic codes from the second class two prime whiteman s generalized cyclotomic sequence with order 6"):
  with members:
    - "cyclic code from the first class whiteman s generalized cyclotomic sequence with order 4"
    - "cyclotomic constructions of cyclic codes with length being the product of two primes"

Connected through hyperedge HE-6 (induced by source paper "weight distributions of cyclic codes with respect to pairwise coprime order elements"):
  with members:
    - "the weight distribution of a class of cyclic codes related to hermitian forms graphs"
    - "a class of three weight cyclic codes"
    - "a family of five weight cyclic codes and their weight enumerators"
    - "hamming weights in irreducible cyclic codes"
    - "the weight distributions of cyclic codes and elliptic curves"

Connected through hyperedge HE-7 (induced by source paper "weight distribution of two classes of cyclic codes with respect to two distinct order elements"):
  with members:
    - "the weight distribution of a class of cyclic codes related to hermitian forms graphs"
    - "hamming weights in irreducible cyclic codes"
    - "the weight distributions of cyclic codes and elliptic curves"

Connected through hyperedge HE-8 (induced by source paper "cyclic codes from dickson polynomials"):
  with members:
    - "a note on cyclic codes from apn 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)