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: "the dimension and minimum distance of two classes of primitive bch codes"
  Abstract: Reed-Solomon codes, a type of BCH codes, are widely employed in communication systems, storage devices and consumer electronics. This fact demonstrates the importance of BCH codes -- a family of cyclic codes -- in practice. In theory, BCH codes are among the best cyclic codes in terms of their error-correcting capability. A subclass of BCH codes are the narrow-sense primitive BCH codes. However, the dimension and minimum distance of these codes are not known in general. The objective of this paper is to determine the dimension and minimum distances of two classes of narrow-sense primitive BCH codes with design distances $\delta=(q-1)q^{m-1}-1-q^{\lfloor (m-1)/2\rfloor}$ and $\delta=(q-1)q^{m-1}-1-q^{\lfloor (m+1)/2\rfloor}$. The weight distributions of some of these BCH codes are also reported. As will be seen, the two classes of BCH codes are sometimes optimal and sometimes among the best linear codes known.

Connected through hyperedge HE-1 (induced by source paper "a class of narrow sense bch codes"):
  with members:
    - "dimensions of nonbinary antiprimitive bch codes and some conjectures"
    - "dimension of nonbinary antiprimitive bch codes"
    - "the minimum distance of some narrow sense primitive bch codes"
    - "dimensions of three types of bch codes over gf q"
    - "lcd cyclic codes over finite fields"
    - "a class of three weight cyclic codes"
    - "hamming weights in irreducible cyclic codes"
    - "exponential sums cyclic codes and sequences the odd characteristic kasami case"

Connected through hyperedge HE-2 (induced by source paper "a class of narrow sense bch codes over mathbb f _q of length frac q m 1 2"):
  with members:
    - "a class of narrow sense bch codes"
    - "the minimum distance of some narrow sense primitive bch codes"
    - "dimensions of three types of bch codes over gf q"
    - "lcd cyclic codes over finite fields"
    - "a class of three weight cyclic codes"

Connected through hyperedge HE-3 (induced by source paper "some binary bch codes with length n 2 m 1"):
  with members:
    - "dimensions of three types of bch codes over gf q"
    - "parameters of two classes of lcd bch codes"
    - "the reversible negacyclic codes over finite fields"
    - "lcd cyclic codes over finite fields"

Connected through hyperedge HE-4 (induced by source paper "dimension of nonbinary antiprimitive bch codes"):
  with members:
    - "dimensions of three types of bch codes over gf q"
    - "parameters of two classes of lcd bch codes"
    - "narrow sense bch codes over gf q with length n frac q m 1 q 1"
    - "the reversible negacyclic codes over finite fields"
    - "lcd cyclic codes over finite fields"

Connected through hyperedge HE-5 (induced by source paper "dimensions of three types of bch codes over gf q"):
  with members:
    - "parameters of two classes of lcd bch codes"
    - "narrow sense bch codes over gf q with length n frac q m 1 q 1"
    - "a family of reversible bch codes"
    - "lcd cyclic codes over finite fields"

Connected through hyperedge HE-6 (induced by source paper "binary linear codes from vectorial boolean functions and their weight distribution"):
  with members:
    - "a construction of binary linear codes from boolean functions"
    - "linear codes from some 2 designs"
    - "linear codes with two or three weights from quadratic bent functions"
    - "a class of two weight and three weight codes and their applications in secret sharing"

Connected through hyperedge HE-7 (induced by source paper "a sequence construction of cyclic codes over finite fields"):
  with members:
    - "a note on cyclic codes from apn functions"
    - "cyclic codes from dickson polynomials"
    - "cyclic codes from cyclotomic sequences of order four"

Connected through hyperedge HE-8 (induced by source paper "infinite families of 2 designs and 3 designs from linear codes"):
  with members:
    - "narrow sense bch codes over gf q with length n frac q m 1 q 1"
    - "hamming weights in irreducible cyclic codes"

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)