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: "z4 linear hadamard and extended perfect codes"
  Abstract: Abstract   If  N  = 2  k  ≥ 16 then there exist exactly ⌊( k  − 1)/2⌋ pairwise nonequivalent  Z  4 -linear Hadamard ( N , 2 N, N /2)-codes and ⌊( k  + 1)/2⌋ pairwise nonequivalent  Z  4 -linear extended perfect ( N , 2  N  /2 N , 4)-codes. Recurrent construction of  Z  4 -linear Hadamard codes is given.

Connected through hyperedge HE-1 (induced by source paper "classification of the z_ 2 z_ 4 linear hadamard codes and their automorphism groups"):
  with members:
    - "z4 linear perfect codes"

Connected through hyperedge HE-2 (induced by source paper "partial permutation decoding for binary linear and z4 linear hadamard codes"):
  with members:
    - "classification of the z_ 2 z_ 4 linear hadamard codes and their automorphism groups"

Connected through hyperedge HE-3 (induced by source paper "product constructions for perfect lee codes"):
  with members:
    - "dense error correcting codes in the lee metric"
    - "codes in permutations and error correction for rank modulation"
    - "error correction of multidimensional bursts"

Connected through hyperedge HE-4 (induced by source paper "dense error correcting codes in the lee metric"):
  with members:
    - "codes in permutations and error correction for rank modulation"
    - "complementary sets generalized reed muller codes and power control for ofdm"
    - "error correction of multidimensional bursts"

Connected through hyperedge HE-5 (induced by source paper "z2z4 linear codes rank and kernel"):
  with members:
    - "z2z4 linear codes generator matrices and duality"

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)