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: "quasi orthogonal stbc with minimum decoding complexity"
  Abstract: In this paper, we consider a quasi-orthogonal (QO) space-time block code (STBC) with minimum decoding complexity (MDC-QO-STBC). We formulate its algebraic structure and propose a systematic method for its construction. We show that a maximum-likelihood (ML) decoder for this MDC-QOSTBC, for any number of transmit antennas, only requires the joint detection of two real symbols. Assuming the use of a square or rectangular quadratic-amplitude modulation (QAM) or multiple phase-shift keying (MPSK) modulation for this MDC-QOSTBC, we also obtain the optimum constellation rotation angle, in order to achieve full diversity and optimum coding gain. We show that the maximum achievable code rate of these MDC-QOSTBC is 1 for three and four antennas and 3/4 for five to eight antennas. We also show that the proposed MDC-QOSTBC has several desirable properties, such as a more even power distribution among antennas and better scalability in adjusting the number of transmit antennas, compared with the coordinate interleaved orthogonal design (CIOD) and asymmetric CIOD (ACIOD) codes. For the case of an odd number of transmit antennas, MDC-QO-STBC also has better decoding performance than CIOD.

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 "reliable mimo optical wireless communications through super rectangular cover"):
  with members:
    - "full large scale diversity space codes for mimo optical wireless communications"
    - "high snr ber comparison of coherent and differentially coherent modulation schemes in lognormal fading channels"
    - "full diversity codes for miso systems equipped with linear or ml detectors"

Connected through hyperedge HE-4 (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"
    - "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"

Connected through hyperedge HE-5 (induced by source paper "energy efficient full diversity collaborative unitary space time block code design via unique factorization of signals"):
  with members:
    - "full diversity codes for miso systems equipped with linear or ml detectors"
    - "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"
    - "the noncoherent rician fading channel part i structure of the capacity achieving input"
    - "noncoherent rician fading channel part ii spectral efficiency in the low power regime"

Connected through hyperedge HE-6 (induced by source paper "generalized distributive law for ml decoding of space time block codes"):
  with members:
    - "a family of fast decodable mido codes from crossed product algebras over q"
    - "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"

Connected through hyperedge HE-7 (induced by source paper "block orthogonal space time code structure and its impact on qrdm decoding complexity reduction"):
  with members:
    - "group decodable space time block codes with code rate 1"
    - "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"

Connected through hyperedge HE-8 (induced by source paper "maximum rate of unitary weight single symbol decodable stbcs"):
  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)