human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "classification of the z_ 2 z_ 4 linear hadamard codes and their automorphism groups"):
  Abstract: A    $Z_{2}Z_{4}$   -linear Hadamard code of length    $\alpha +2\beta =2^{t}$    is a binary Hadamard code, which is the Gray map image of a    $Z_{2}Z_{4}$   -additive code with    $\alpha $    binary coordinates and    $\beta $    quaternary coordinates. It is known that there are exactly    $\lfloor \frac {t-1}{2} \rfloor $    and    $\lfloor \frac {t}{2} \rfloor $    nonequivalent    $Z_{2}Z_{4}$   -linear Hadamard codes of length    $2^{t}$   , with    $\alpha =0$    and    $\alpha \not =0$   , respectively, for all    $t\geq 3$   . In this paper, it is shown that each    $Z_{2}Z_{4}$   -linear Hadamard code with    $\alpha =0$    is equivalent to a    $Z_{2}Z_{4}$   -linear Hadamard code with    $\alpha \not =0$   , so there are only    $\lfloor \frac {t}{2} \rfloor $    nonequivalent    $Z_{2}Z_{4}$   -linear Hadamard codes of length    $2^{t}$   . Moreover, the order of the monomial automorphism group for the    $Z_{2}Z_{4}$   -additive Hadamard codes and the permutation automorphism group of the corresponding    $Z_{2}Z_{4}$   -linear Hadamard codes are given.

Includes members:
  Member "z4 linear perfect codes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on the automorphism groups of the z2z4 linear 1 perfect and preparata like codes")
  Member "z4 linear hadamard and extended perfect codes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "partial permutation decoding for binary linear and z4 linear hadamard codes")

Question: Please tell me which class the source paper 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)