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: "a family of fast decodable mido codes from crossed product algebras over q"
  Abstract: Multiple Input Double Output (MIDO) asymmetric space-time codes for 4 transmit antennas and 2 receive antennas can be employed in the downlink from base stations to portable devices. Previous MIDO code constructions with low Maximum Likelihood (ML) decoding complexity, full diversity and the non-vanishing determinant (NVD) property are mostly based on cyclic division algebras. In this paper, a new family of MIDO codes with the NVD property based on crossed-product algebras over Q is introduced. Fast decodability follows naturally from the structure of the codewords which consist of four generalized Alamouti blocks. The associated ML complexity order is the lowest known for full-rate MIDO codes (O(M^{10}) instead of O(M^{16}) with respect to the real constellation size M). Numerical simulations show that these codes have a performance from comparable up to 1dB gain compared to the best known MIDO code with the same complexity.

Connected through hyperedge HE-1 (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"
    - "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-2 (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"
    - "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-3 (induced by source paper "fast decodable mido codes with large coding gain"):
  with members:
    - "fast decodable asymmetric space time codes from division algebras"
    - "an enhanced dmt optimality criterion for stbc schemes for asymmetric mimo systems"
    - "iterated space time code constructions from cyclic algebras"
    - "improved perfect space time block codes"
    - "space time block codes from nonassociative division algebras"
    - "maximal orders in the design of dense space time lattice codes"
    - "on fast decodable space time block codes"

Connected through hyperedge HE-4 (induced by source paper "generalized distributive law for ml decoding of space time block codes"):
  with members:
    - "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"
    - "quasi orthogonal stbc with minimum decoding complexity"

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)