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: "high rate multi symbol decodable stbcs from clifford algebras"
  Abstract: It is well known that Space-Time Block Codes (STBCs) obtained from Orthogonal Designs (ODs) are single-symbol-decodable (SSD) and from Quasi-Orthogonal Designs (QODs) are double-symbol decodable. However, there are SSD codes that are not obtainable from ODs and DSD codes that are not obtainable from QODs. In this paper a method of constructing $g$-symbol decodable ($g$-SD) STBCs using representations of Clifford algebras are presented which when specialized to $g=1,2$ gives SSD and DSD codes respectively. For the number of transmit antennas $2^a$ the rate (in complex symbols per channel use) of the $g$-SD codes presented in this paper is $\frac{a+1-g}{2^{a-g}}$. The maximum rate of the DSD STBCs from QODs reported in the literature is $\frac{a}{2^{a-1}}$ which is smaller than the rate $\frac{a-1}{2^{a-2}}$ of the DSD codes of this paper, for $2^a$ transmit antennas. In particular, the reported DSD codes for 8 and 16 transmit antennas offer rates 1 and 3/4 respectively whereas the known STBCs from QODs offer only 3/4 and 1/2 respectively. The construction of this paper is applicable for any number of transmit antennas.

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"
    - "multigroup 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"
    - "multigroup decodable stbcs from clifford algebras"

Connected through hyperedge HE-3 (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"
    - "multi group ml decodable collocated and distributed space time block codes"
    - "algebraic distributed differential space time codes with low decoding complexity"

Connected through hyperedge HE-4 (induced by source paper "multi group ml decodable collocated and distributed space time block codes"):
  with members:
    - "four group decodable space time block codes"
    - "high rate single symbol decodable precoded dstbcs for cooperative networks"
    - "algebraic distributed differential space time codes with low decoding complexity"
    - "a non orthogonal distributed space time coded protocol part i signal model and design criteria"

Connected through hyperedge HE-5 (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"
    - "multigroup decodable stbcs from clifford algebras"

Connected through hyperedge HE-6 (induced by source paper "algebraic distributed space time codes with low ml decoding complexity"):
  with members:
    - "a non orthogonal distributed space time coded protocol part ii code construction and dm g tradeoff"

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)