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 decodable mido codes with large coding gain"):
  Abstract: In this paper, a new method is proposed to obtain full-diversity, rate-2 (rate of 2 complex symbols per channel use) space-time block codes (STBCs) that are full-rate for multiple input, double output (MIDO) systems. Using this method, rate-2 STBCs for $4\times2$, $6 \times 2$, $8\times2$ and $12 \times 2$ systems are constructed and these STBCs are fast ML-decodable, have large coding gains, and STBC-schemes consisting of these STBCs have a non-vanishing determinant (NVD) so that they are DMT-optimal for their respective MIDO systems. It is also shown that the SR-code [R. Vehkalahti, C. Hollanti, and F. Oggier, "Fast-Decodable Asymmetric Space-Time Codes from Division Algebras," IEEE Trans. Inf. Theory, Apr. 2012] for the $4\times2$ system, which has the lowest ML-decoding complexity among known rate-2 STBCs for the $4\times2$ MIDO system with a large coding gain for 4-/16-QAM, has the same algebraic structure as the STBC constructed in this paper for the $4\times2$ system. This also settles in positive a previous conjecture that the STBC-scheme that is based on the SR-code has the NVD property and hence is DMT-optimal for the $4\times2$ system.

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 "an enhanced dmt optimality criterion for stbc schemes for asymmetric mimo systems":
    also connected through other hyperedges:
      (none)
  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 "improved perfect space time block codes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (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-4 (induced by source paper "revisited design criteria for stbcs with reduced complexity ml decoding")
  Member "space time block codes from nonassociative division algebras":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "the nonassociative algebras used to build fast decodable space time block codes")
  Member "maximal orders in the design of dense space time lattice codes":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "on fast decodable algebraic space time 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)