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 low complexity decodable rate 5 4 stbc for four transmit antennas with nonvanishing determinants"):
  Abstract: The use of Space-Time Block Codes (STBCs) increases significantly the optimal detection complexity at the receiver unless the low-complexity decodability property is taken into consideration in the STBC design. In this paper we propose a new low- complexity decodable rate-5/4 full-diversity 4 x 4 STBC. We provide an analytical proof that the proposed code has the Non-Vanishing-Determinant (NVD) property, a property that can be exploited through the use of adaptive modulation which changes the transmission rate according to the wireless channel quality. We compare the proposed code to the best existing low-complexity decodable rate-5/4 full-diversity 4 x 4 STBCs in terms of performance over quasi-static Rayleigh fading channels, worst- case complexity, average complexity, and Peak-to- Average Power Ratio (PAPR). Our code is found to provide better performance, lower average decoding complexity, and lower PAPR at the expense of a slight increase in worst-case decoding complexity.

Includes members:
  Member "low ml decoding complexity large coding gain full rate full diversity stbcs for 2 x 2 and 4 x 2 mimo systems":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "stbcs with reduced sphere decoding complexity for two user mimo mac")
  Member "on fast 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")

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)