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: "multi group ml decodable collocated and distributed space time block codes"
  Abstract: In this paper, collocated and distributed space-time block codes (DSTBCs) which admit multi-group maximum likelihood (ML) decoding are studied. First the collocated case is considered and the problem of constructing space-time block codes (STBCs) which optimally tradeoff rate and ML decoding complexity is posed. Recently, sufficient conditions for multi-group ML decodability have been provided in the literature and codes meeting these sufficient conditions were called Clifford Unitary Weight (CUW) STBCs. An algebraic framework based on extended Clifford algebras is proposed to study CUW STBCs and using this framework, the optimal tradeoff between rate and ML decoding complexity of CUW STBCs is obtained for few specific cases. Code constructions meeting this tradeoff optimally are also provided. The paper then focuses on multi-group ML decodable DSTBCs for application in synchronous wireless relay networks and three constructions of four-group ML decodable DSTBCs are provided. Finally, the OFDM based Alamouti space-time coded scheme proposed by Li-Xia for a 2 relay asynchronous relay network is extended to a more general transmission scheme that can achieve full asynchronous cooperative diversity for arbitrary number of relays. It is then shown how differential encoding at the source can be combined with the proposed transmission scheme to arrive at a new transmission scheme that can achieve full cooperative diversity in asynchronous wireless relay networks with no channel information and also no timing error knowledge at the destination node. Four-group decodable DSTBCs applicable in the proposed OFDM based transmission scheme are also given.

Connected through hyperedge HE-1 (induced by source paper "construction of block orthogonal stbcs and reducing their sphere decoding complexity"):
  with members:
    - "fast decodable asymmetric space time codes from division algebras"
    - "block orthogonal space time code structure and its impact on qrdm decoding complexity reduction"
    - "minimizing the complexity of fast sphere decoding of stbcs"
    - "four group decodable space time block codes"
    - "fast maximum likelihood decoding of the golden code"
    - "on fast decodable space time block codes"
    - "high rate multi symbol decodable stbcs from clifford algebras"
    - "multigroup decodable stbcs from clifford algebras"

Connected through hyperedge HE-2 (induced by source paper "algebraic fast decodable relay codes for distributed communications"):
  with members:
    - "quadratic forms and space time block codes from generalized quaternion and biquaternion algebras"
    - "fast group decodable stbcs via codes over gf 4"
    - "on fast decodable space time block codes"
    - "optimal space time codes for the mimo amplify and forward cooperative channel"
    - "on the achievable diversity multiplexing tradeoffs in half duplex cooperative channels"

Connected through hyperedge HE-3 (induced by source paper "fast decodable asymmetric space time codes from division algebras"):
  with members:
    - "maximal orders in the design of dense space time lattice codes"
    - "on fast decodable space time block codes"

Connected through hyperedge HE-4 (induced by source paper "maximum rate of 3 and 4 real symbol ml decodable unitary weight stbcs"):
  with members:
    - "maximum rate of unitary weight single symbol decodable stbcs"
    - "high rate multi symbol decodable stbcs from clifford algebras"
    - "algebraic distributed differential space time codes with low decoding complexity"

Connected through hyperedge HE-5 (induced by source paper "a new full diversity criterion and low complexity stbcs with partial interference cancellation decoding"):
  with members:
    - "fast group decodable stbcs via codes over gf 4"
    - "full diversity space time block codes with low complexity partial interference cancellation group decoding"
    - "two designs of space time block codes achieving full diversity with partial interference cancellation group decoding"
    - "four group decodable space time block codes"
    - "on full diversity space time block codes with partial interference cancellation group decoding"
    - "on fast decodable space time block codes"
    - "quasi orthogonal stbc with minimum decoding complexity"
    - "multigroup decodable stbcs from clifford algebras"

Connected through hyperedge HE-6 (induced by source paper "fast group decodable stbcs via codes over gf 4"):
  with members:
    - "four group decodable space time block codes"
    - "fast maximum likelihood decoding of the golden code"
    - "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-7 (induced by source paper "cooperative transmission for wireless relay networks using limited feedback"):
  with members:
    - "network beamforming using relays with perfect channel information"
    - "distributed space time codes for cooperative networks with partial csi"
    - "distributed transmit beamforming using feedback control"

Connected through hyperedge HE-8 (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 decoding complexity large coding gain full rate full diversity stbc for 4 x 2 mimo system"
    - "a low complexity full rate full diversity 2x2 stbc with golden code s coding gain"
    - "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)