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: "group decodable space time block codes with code rate 1"
  Abstract: High-rate space-time block codes (STBC with code rate >; 1) in multi-input multi-output (MIMO) systems are able to provide both spatial multiplexing gain and diversity gain, but have high maximum likelihood (ML) decoding complexity. Since group-decodable (quasi-orthogonal) code structure can reduce the decoding complexity, we present in this paper systematic methods to construct group-decodable high-rate STBC with full symbol-wise diversity gain for arbitrary transmit antenna number and code length. We show that the proposed group-decodable STBC can achieve high code rate that increases almost linearly with the transmit antenna number, and the slope of this near-linear dependence increases with the code length. Comparisons with existing low-rate and high-rate codes (such as orthogonal STBC and algebraic STBC) are conducted to show the decoding complexity reduction and good code performance achieved by the proposed codes.

Connected through hyperedge HE-1 (induced by source paper "revisited design criteria for stbcs with reduced complexity ml decoding"):
  with members:
    - "achieving low complexity maximum likelihood detection for the 3d mimo code"
    - "construction of block orthogonal stbcs and reducing their sphere decoding complexity"
    - "fast decodable asymmetric space time codes from division algebras"
    - "iterated space time code constructions from cyclic algebras"
    - "a family of fast decodable mido codes from crossed product algebras over q"
    - "block orthogonal space time code structure and its impact on qrdm decoding complexity reduction"
    - "optimization of fast decodable full rate stbc with non vanishing determinants"
    - "quadratic forms and space time block codes from generalized quaternion and biquaternion algebras"

Connected through hyperedge HE-2 (induced by source paper "a novel construction of multi group decodable space time block codes"):
  with members:
    - "maximum rate of 3 and 4 real symbol ml decodable unitary weight stbcs"
    - "a new low complexity decodable rate 5 4 stbc for four transmit antennas with nonvanishing determinants"
    - "four group decodable space time block codes"
    - "on the search for high rate quasi orthogonal space time block code"
    - "on fast decodable space time block codes"
    - "quasi orthogonal stbc with minimum decoding complexity"

Connected through hyperedge HE-3 (induced by source paper "a new family of low complexity stbcs for four transmit antennas"):
  with members:
    - "a novel construction of multi group decodable space time block codes"
    - "block orthogonal space time code structure and its impact on qrdm decoding complexity reduction"
    - "optimization of fast decodable full rate stbc with non vanishing determinants"
    - "on the average complexity of sphere decoding in lattice space time coded mimo channel"
    - "four group decodable space time block codes"
    - "on fast decodable space time block codes"

Connected through hyperedge HE-4 (induced by source paper "block orthogonal space time code structure and its impact on qrdm decoding complexity reduction"):
  with members:
    - "four group decodable space time block codes"
    - "on the search for high rate quasi orthogonal space time block code"
    - "on fast decodable space time block codes"
    - "quasi orthogonal stbc with minimum decoding complexity"

Connected through hyperedge HE-5 (induced by source paper "minimizing the complexity of fast sphere decoding of stbcs"):
  with members:
    - "construction of block orthogonal stbcs and reducing their sphere decoding complexity"
    - "fast decodable asymmetric space time codes from division algebras"
    - "iterated space time code constructions from cyclic algebras"
    - "block orthogonal space time code structure and its impact on qrdm decoding complexity reduction"
    - "optimization of fast decodable full rate stbc with non vanishing determinants"
    - "quadratic forms and space time block codes from generalized quaternion and biquaternion algebras"
    - "four group decodable space time block codes"
    - "fast maximum likelihood decoding of the golden code"

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)