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: "multigroup decodable stbcs from clifford algebras"
  Abstract: A Space-Time Block Code (STBC) in $K$ symbols (variables) is called $g$-group decodable STBC if its maximum-likelihood decoding metric can be written as a sum of $g$ terms such that each term is a function of a subset of the $K$ variables and each variable appears in only one term. In this paper we provide a general structure of the weight matrices of multi-group decodable codes using Clifford algebras. Without assuming that the number of variables in each group to be the same, a method of explicitly constructing the weight matrices of full-diversity, delay-optimal $g$-group decodable codes is presented for arbitrary number of antennas. For the special case of $N_t=2^a$ we construct two subclass of codes: (i) A class of $2a$-group decodable codes with rate $\frac{a}{2^{(a-1)}}$, which is, equivalently, a class of Single-Symbol Decodable codes, (ii) A class of $(2a-2)$-group decodable with rate $\frac{(a-1)}{2^{(a-2)}}$, i.e., a class of Double-Symbol Decodable codes. Simulation results show that the DSD codes of this paper perform better than previously known Quasi-Orthogonal Designs.

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"
    - "multi group ml decodable collocated and distributed space time block codes"
    - "on fast decodable space time block codes"
    - "high rate multi symbol decodable stbcs from clifford algebras"

Connected through hyperedge HE-2 (induced by source paper "a new family of low complexity decodable stbcs for four transmit antennas"):
  with members:
    - "four group decodable space time block codes"
    - "on fast decodable space time block codes"
    - "high rate multi symbol decodable stbcs from clifford algebras"

Connected through hyperedge HE-3 (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"
    - "multi group ml decodable collocated and distributed space time block codes"
    - "on fast decodable space time block codes"
    - "quasi orthogonal stbc with minimum decoding complexity"

Connected through hyperedge HE-4 (induced by source paper "a new class of tast codes with a simplified tree structure"):
  with members:
    - "perfect space time codes with minimum and non minimum delay for any number of antennas"

Connected through hyperedge HE-5 (induced by source paper "lr aided mmse lattice decoding is dmt optimal for all approximately universal codes"):
  with members:
    - "lll reduction achieves the receive diversity in mimo decoding"
    - "on the limitations of the naive lattice decoding"
    - "complex lattice reduction algorithm for low complexity mimo detection"
    - "approximately universal codes over slow fading channels"

Connected through hyperedge HE-6 (induced by source paper "four group decodable space time block codes"):
  with members:
    - "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 "on full diversity space time block codes with partial interference cancellation group decoding"):
  with members:
    - "four group decodable space time block codes"
    - "on the search for high rate quasi orthogonal space time block code"
    - "quasi orthogonal stbc with minimum decoding complexity"

Connected through hyperedge HE-8 (induced by source paper "stbcs from representation of extended clifford algebras"):
  with members:
    - "algebraic distributed space time codes with low ml decoding complexity"
    - "noncoherent low decoding complexity space time codes for wireless relay networks"
    - "high rate multi symbol decodable stbcs from clifford algebras"

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)