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: "duadic group algebra codes"
  Abstract: Duadic group algebra codes are a generalization of quadratic residue codes. This paper settles an open problem raised by Zhu concerning the existence of duadic group algebra codes. These codes can be used to construct degenerate quantum stabilizer codes that have the nice feature that many errors of small weight do not need error correction; this fact is illustrated by an example.

Connected through hyperedge HE-1 (induced by source paper "dihedral group codes over finite fields"):
  with members:
    - "thresholds of random quasi abelian codes"

Connected through hyperedge HE-2 (induced by source paper "isometrically self dual cyclic codes"):
  with members:
    - "polyadic constacyclic codes"
    - "computational results of duadic double circulant codes"

Connected through hyperedge HE-3 (induced by source paper "iso orthogonality and type ii duadic constacyclic codes"):
  with members:
    - "polyadic constacyclic codes"
    - "on the existence of self dual permutation codes of finite groups"
    - "computational results of duadic double circulant codes"
    - "constacyclic codes over finite fields"

Connected through hyperedge HE-4 (induced by source paper "polyadic constacyclic codes"):
  with members:
    - "computational results of duadic double circulant codes"
    - "constacyclic codes over finite fields"

Connected through hyperedge HE-5 (induced by source paper "on quantum and classical error control codes constructions and applications"):
  with members:
    - "families of ldpc codes derived from nonprimitive bch codes and cyclotomic cosets"
    - "on the stopping distance and the stopping redundancy of codes"
    - "tree based construction of ldpc codes having good pseudocodeword weights"

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)