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: "generalizing bounds on the minimum distance of cyclic codes using cyclic product codes"
  Abstract: Two generalizations of the Hartmann--Tzeng (HT) bound on the minimum distance of q-ary cyclic codes are proposed. The first one is proven by embedding the given cyclic code into a cyclic product code. Furthermore, we show that unique decoding up to this bound is always possible and outline a quadratic-time syndrome-based error decoding algorithm. The second bound is stronger and the proof is more involved. #R##N#Our technique of embedding the code into a cyclic product code can be applied to other bounds, too and therefore generalizes them.

Connected through hyperedge HE-1 (induced by source paper "spectral analysis of quasi cyclic product codes"):
  with members:
    - "construction of quasi cyclic product codes"
    - "decoding of quasi cyclic codes up to a new lower bound on the minimum distance"
    - "bounds on the minimum distance of punctured quasi cyclic ldpc codes"
    - "on the decoding of quasi bch codes"
    - "a new bound on the minimum distance of cyclic codes using small minimum distance cyclic codes"
    - "on quasi cyclic codes as a generalization of cyclic codes"
    - "collaborative decoding of interleaved reed solomon codes and concatenated code designs"

Connected through hyperedge HE-2 (induced by source paper "decoding of repeated root cyclic codes up to new bounds on their minimum distance"):
  with members:
    - "a new bound on the minimum distance of cyclic codes using small minimum distance cyclic codes"
    - "linear algebraic list decoding of folded reed solomon codes"
    - "list decoding tensor products and interleaved codes"
    - "collaborative decoding of interleaved reed solomon codes and concatenated code designs"

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)