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 "fast group decodable stbcs via codes over gf 4"):
  Abstract: In this paper we construct low decoding complexity STBCs by using the Pauli matrices as linear dispersion matrices. In this case the Hurwitz-Radon orthogonality condition is shown to be easily checked by transferring the problem to $\mathbb{F}_4$ domain. The problem of constructing low decoding complexity STBCs is shown to be equivalent to finding certain codes over $\mathbb{F}_4$. It is shown that almost all known low complexity STBCs can be obtained by this approach. New codes are given that have the least known decoding complexity in particular ranges of rate.

Includes members:
  Member "four group decodable space time block codes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a survey on mimo transmission with discrete input signals technical challenges advances and future trends")
  Member "fast maximum likelihood decoding of the golden code":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a survey on mimo transmission with discrete input signals technical challenges advances and future trends")
  Member "on the search for high rate quasi orthogonal space time block code":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "bounds on fast decodability of space time block codes skew hermitian matrices and azumaya algebras")
  Member "multi group ml decodable collocated and distributed space time block codes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "construction of block orthogonal stbcs and reducing their sphere decoding complexity")
  Member "on fast decodable space time block codes":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "a survey on mimo transmission with discrete input signals technical challenges advances and future trends")
  Member "quasi orthogonal stbc with minimum decoding complexity":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "a survey on mimo transmission with discrete input signals technical challenges advances and future trends")

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)