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 new family of low complexity stbcs for four transmit antennas"):
  Abstract: Space-Time Block Codes (STBCs) suffer from a prohibitively high decoding complexity unless the low-complexity decodability property is taken into consideration in the STBC design. For this purpose, several families of STBCs that involve a reduced decoding complexity have been proposed, notably the multi-group decodable and the fast decodable (FD) codes. Recently, a new family of codes that combines both of these families namely the fast group decodable (FGD) codes was proposed. In this paper, we propose a new construction scheme for rate-1 FGD codes for 2^a transmit antennas. The proposed scheme is then applied to the case of four transmit antennas and we show that the new rate-1 FGD code has the lowest worst-case decoding complexity among existing comparable STBCs. The coding gain of the new rate-1 code is optimized through constellation stretching and proved to be constant irrespective of the underlying QAM constellation prior to normalization. Next, we propose a new rate-2 FD STBC by multiplexing two of our rate-1 codes by the means of a unitary matrix. Also a compromise between rate and complexity is obtained through puncturing our rate-2 FD code giving rise to a new rate-3/2 FD code. The proposed codes are compared to existing codes in the literature and simulation results show that our rate-3/2 code has a lower average decoding complexity while our rate-2 code maintains its lower average decoding complexity in the low SNR region. If a time-out sphere decoder is employed, our proposed codes outperform existing codes at high SNR region thanks to their lower worst-case decoding complexity.

Includes members:
  Member "a novel construction of multi group decodable space time block codes":
    also connected through other hyperedges:
      (none)
  Member "block orthogonal space time code structure and its impact on qrdm decoding complexity reduction":
    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 "optimization of fast decodable full rate stbc with non vanishing determinants":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "revisited design criteria for stbcs with reduced complexity ml decoding")
  Member "on the average complexity of sphere decoding in lattice space time coded mimo channel":
    also connected through other hyperedges:
      (none)
  Member "group decodable space time block codes with code rate 1":
    also connected through other hyperedges:
      - Hyperedge HE-3 (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-4 (induced by source paper "a survey on mimo transmission with discrete input signals technical challenges advances and future trends")
  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")

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)