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 "a novel construction of multi group decodable space time block codes"):
  Abstract: Complex Orthogonal Design (COD) codes are known to have the lowest detection complexity among Space-Time Block Codes (STBCs). However, the rate of square COD codes decreases exponentially with the number of transmit antennas. The Quasi-Orthogonal Design (QOD) codes emerged to provide a compromise between rate and complexity as they offer higher rates compared to COD codes at the expense of an increase of decoding complexity through partially relaxing the orthogonality conditions. The QOD codes were then generalized with the so called g-symbol and g-group decodable STBCs where the number of orthogonal groups of symbols is no longer restricted to two as in the QOD case. However, the adopted approach for the construction of such codes is based on sufficient but not necessary conditions which may limit the achievable rates for any number of orthogonal groups. In this paper, we limit ourselves to the case of Unitary Weight (UW)-g-group decodable STBCs for 2a transmit antennas where the weight matrices are required to be single thread matrices with non-zero entries ∈{± 1,± j} and address the problem of finding the highest achievable rate for any number of orthogonal groups. This special type of weight matrices guarantees full symbol-wise diversity and subsumes a wide range of existing codes in the literature. We show that in this case an exhaustive search can be applied to find the maximum achievable rates for UW-g-group decodable STBCs with g>;1. For this purpose, we extend our previously proposed approach for constructing UW-2-group decodable STBCs based on necessary and sufficient conditions to the case of UW-g-group decodable STBCs in a recursive manner.

Includes members:
  Member "maximum rate of 3 and 4 real symbol ml decodable unitary weight stbcs":
    also connected through other hyperedges:
      (none)
  Member "a new low complexity decodable rate 5 4 stbc for four transmit antennas with nonvanishing determinants":
    also connected through other hyperedges:
      (none)
  Member "group decodable space time block codes with code rate 1":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "revisited design criteria for stbcs with reduced complexity ml decoding")
  Member "four group decodable space time block codes":
    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 "on fast decodable space time block codes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (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-5 (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)