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: "fast decodable asymmetric space time codes from division algebras"
  Abstract: Multiple-input double-output (MIDO) codes are important in the near-future wireless communications, where the portable end-user device is physically small and will typically contain at most two receive antennas. Especially tempting is the 4×2 channel due to its immediate applicability in the digital video broadcasting (DVB). Such channels optimally employ rate-two space-time (ST) codes consisting of (4×4) matrices. Unfortunately, such codes are in general very complex to decode, hence setting forth a call for constructions with reduced complexity. Recently, some reduced complexity constructions have been proposed, but they have mainly been based on different ad hoc methods and have resulted in isolated examples rather than in a more general class of codes. In this paper, it will be shown that a family of division algebra based MIDO codes will always result in at least 37.5% worst-case complexity reduction, while maintaining full diversity and, for the first time, the nonvanishing determinant (NVD) property. The reduction follows from the fact that, similarly to the Alamouti code, the codes will be subsets of matrix rings of the Hamiltonian quaternions, hence allowing simplified decoding. At the moment, such reductions are among the best known for rate-two MIDO codes [5], [6]. Several explicit constructions are presented and shown to have excellent performance through computer simulations.simulations.

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"
    - "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"
    - "group decodable space time block codes with code rate 1"

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"
    - "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"
    - "compute and forward harnessing interference through structured codes"

Connected through hyperedge HE-4 (induced by source paper "channel pre inversion and max sinr vector perturbation for large scale broadcast channels"):
  with members:
    - "hybrid channel pre inversion and interference alignment strategies"
    - "minimizing the complexity of fast sphere decoding of stbcs"
    - "fixed complexity vector perturbation with block diagonalization for mu mimo systems"
    - "vector precoding for wireless mimo systems and its replica analysis"
    - "on fast decodable space time block codes"

Connected through hyperedge HE-5 (induced by source paper "almost universal codes achieving ergodic mimo capacity within a constant gap"):
  with members:
    - "polar codes and polar lattices for independent fading channels"
    - "algebraic lattice codes achieve the capacity of the compound block fading channel"
    - "almost universal codes for fading wiretap channels"
    - "division algebra codes achieve mimo block fading channel capacity within a constant gap"
    - "number field lattices achieve gaussian and rayleigh channel capacity within a constant gap"
    - "precoded integer forcing universally achieves the mimo capacity to within a constant gap"
    - "inverse determinant sums and connections between fading channel information theory and algebra"
    - "dispersion analysis of infinite constellations in ergodic fading channels"

Connected through hyperedge HE-6 (induced by source paper "bounds on fast decodability of space time block codes skew hermitian matrices and azumaya algebras"):
  with members:
    - "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"
    - "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-7 (induced by source paper "constructions of fast decodable distributed space time codes"):
  with members:
    - "iterated space time code constructions from cyclic algebras"
    - "algebraic fast decodable relay codes for distributed communications"
    - "on fast decodable space time block codes"
    - "optimal space time codes for the mimo amplify and forward cooperative channel"

Connected through hyperedge HE-8 (induced by source paper "the nonassociative algebras used to build fast decodable space time block codes"):
  with members:
    - "iterated space time code constructions from cyclic algebras"
    - "space time block codes from nonassociative division algebras"
    - "minimizing the complexity of fast sphere decoding of stbcs"

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)