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 "bounds on fast decodability of space time block codes skew hermitian matrices and azumaya algebras"):
  Abstract: We study fast lattice decodability of space-time block codes for    $n$    transmit and receive antennas, written very generally as a linear combination    $\sum _{i=1}^{2l} s_{i} A_{i}$   , where the    $s_{i}$    are real information symbols and the    $A_{i}$    are    $n\times n~ \mathbb {R}$   -linearly independent complex-valued matrices. We show that the mutual orthogonality condition    $A_{i}A_{\vphantom {R_{R_{R_{a}}}}j}^{*} + A_{j}A_{i}^{*}=0$    for distinct basis matrices is not only sufficient but also necessary for fast decodability. We build on this to show that for full-rate (   $l = n^{2}$   ) transmission, the decoding complexity can be no better than    $ |S|^{n^{2}+1}$   , where    $ |S|$    is the size of the effective real signal constellation. We also show that for full-rate transmission,    $g$   -group decodability, as defined by Jithamithra and Rajan, is impossible for any    $g\ge 2$   . We then use the theory of Azumaya algebras to derive bounds on the maximum number of groups into which the basis matrices can be partitioned so that the matrices in different groups are mutually orthogonal—a key measure of fast decodability. We show that in general, this maximum number is of the order of only the 2-adic value of    $n$   . In the case where the matrices    $A_{i}$    arise from a division algebra, which is most desirable for diversity, we show that the maximum number of groups is only 4. As a result, the decoding complexity for this case is no better than    $ |S|^{\lceil l/2 \rceil }$    for any rate    $l$   .

Includes members:
  Member "fast decodable asymmetric space time codes from division algebras":
    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 "iterated space time code constructions from cyclic algebras":
    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 "a family of fast decodable mido codes from crossed product algebras over q":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "revisited design criteria for stbcs with reduced complexity ml decoding")
  Member "minimizing the complexity of fast sphere decoding of stbcs":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "on fast decodable algebraic space time codes")
  Member "four group 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 "on the search for high rate quasi orthogonal space time block code":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "a novel construction of multi group decodable space time block codes")
  Member "on fast decodable space time block codes":
    also connected through other hyperedges:
      - Hyperedge HE-7 (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)