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: "four group decodable space time block codes"
  Abstract: Two new rate-one full-diversity space-time block codes (STBCs) are proposed. They are characterized by the lowest decoding complexity among the known rate-one STBC, arising due to the complete separability of the transmitted symbols into four groups for maximum likelihood detection. The first and the second codes are delay-optimal if the number of transmit antennas is a power of 2 and even, respectively. The exact pairwise error probability is derived to allow for the performance optimization of the two codes. Compared with existing low-decoding complexity STBC, the two new codes offer several advantages such as higher code rate, lower encoding/decoding delay and complexity, lower peak-to-average power ratio, and better performance.

Connected through hyperedge HE-1 (induced by source paper "a survey on mimo transmission with discrete input signals technical challenges advances and future trends"):
  with members:
    - "asymptotic performance analysis of a k hop amplify and forward relay mimo channel"
    - "iterative distributed minimum total mse approach for secure communications in mimo interference channels"
    - "asymptotic analysis of su mimo channels with transmitter noise and mismatched joint decoding"
    - "secure massive mimo transmission with an active eavesdropper"
    - "interference aligned space time transmission with diversity for the 2 times 2 x network"
    - "space time encoded miso broadcast channel with outdated csit an error rate and diversity performance analysis"
    - "high snr asymptotics of mutual information for discrete constellations with applications to bicm"
    - "differential distributed space time coding with imperfect synchronization in frequency selective channels"

Connected through hyperedge HE-2 (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-3 (induced by source paper "fast decodable space time codes for the n relay and multiple access mimo channel"):
  with members:
    - "constructions of fast decodable distributed space time codes"
    - "bounds on fast decodability of space time block codes skew hermitian matrices and azumaya algebras"
    - "algebraic codes and a new physical layer transmission protocol for wireless distributed storage systems"
    - "fast decodable asymmetric space time codes from division algebras"
    - "iterated space time code constructions from cyclic algebras"
    - "algebraic fast decodable relay codes for distributed communications"
    - "quadratic forms and space time block codes from generalized quaternion and biquaternion algebras"
    - "minimizing the complexity of fast sphere decoding of stbcs"

Connected through hyperedge HE-4 (induced by source paper "bounds on fast decodability of space time block codes skew hermitian matrices and azumaya algebras"):
  with members:
    - "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"
    - "minimizing the complexity of fast sphere decoding of stbcs"
    - "on the search for high rate quasi orthogonal space time block code"
    - "on fast decodable space time block codes"

Connected through hyperedge HE-5 (induced by source paper "achieving low complexity maximum likelihood detection for the 3d mimo code"):
  with members:
    - "a new family of low complexity stbcs for four transmit antennas"
    - "distributed mimo coding scheme with low decoding complexity for future mobile tv broadcasting"
    - "minimizing the complexity of fast sphere decoding of stbcs"
    - "two designs of space time block codes achieving full diversity with partial interference cancellation group decoding"
    - "on full diversity space time block codes with partial interference cancellation group decoding"
    - "fast maximum likelihood decoding of the golden code"
    - "3d mimo scheme for broadcasting future digital tv in single frequency networks"
    - "on fast decodable space time block codes"

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

Connected through hyperedge HE-7 (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"
    - "group decodable space time block codes with code rate 1"
    - "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-8 (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"
    - "group decodable space time block codes with code rate 1"
    - "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)