human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "a low decoding complexity large coding gain full rate full diversity stbc for 4 x 2 mimo system"
  Abstract: This paper proposes a low decoding complexity, full-diversity and full-rate space-time block code (STBC) for 4 transmit and 2 receive ($4\times 2$) multiple-input multiple-output (MIMO) systems. For such systems, the best code known is the DjABBA code and recently, Biglieri, Hong and Viterbo have proposed another STBC (BHV code) which has lower decoding complexity than DjABBA but does not have full-diversity like the DjABBA code. The code proposed in this paper has the same decoding complexity as the BHV code for square QAM constellations but has full-diversity as well. Compared to the best code in the DjABBA family of codes, our code has lower decoding complexity, a better coding gain and hence a better error performance as well. Simulation results confirming these are presented.

Connected through hyperedge HE-1 (induced by source paper "low ml decoding complexity large coding gain full rate full diversity stbcs for 2 x 2 and 4 x 2 mimo systems"):
  with members:
    - "a low complexity full rate full diversity 2x2 stbc with golden code s coding gain"
    - "multi group ml decodable collocated and distributed space time block codes"
    - "on fast decodable space time block codes"

Connected through hyperedge HE-2 (induced by source paper "a low complexity full rate full diversity 2x2 stbc with golden code s coding gain"):
  with members:
    - "rotated and scaled alamouti coding"
    - "on fast decodable space time block codes"

Question: Please tell me which class the center node 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)