human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "revisited design criteria for stbcs with reduced complexity ml decoding"):
  Abstract: The design of linear STBCs offering a low-complexity ML decoding using the well known Sphere Decoder (SD) has been extensively studied in last years. The first considered approach to derive design criteria for the construction of such codes is based on the Hurwitz-Radon (HR) Theory for mutual orthogonality between the weight matrices defining the linear code. This appproach served to construct new families of codes admitting fast sphere decoding such as multi-group decodable, fast decodable, and fast-group decodable codes. In a second Quadratic Form approach, the Fast Sphere Decoding (FSD) complexity of linear STBCs is captured by a Hurwitz Radon Quadratic Form (HRQF) matrix based in its essence on the HR Theory. In this work, we revisit the structure of weight matrices for STBCs to admit Fast Sphere decoding. We first propose novel sufficient conditions and design criteria for reduced-complexity ML decodable linear STBCs considering an arbitrary number of antennas and linear STBCs of an arbitrary coding rate. Then we apply the derived criteria to the three families of codes mentioned above and provide analytical proofs showing that the FSD complexity depends only on the weight matrices and their ordering and not on the channel gains or the number of antennas and explain why the so far used HR theory-based approaches are suboptimal.

Includes members:
  Member "achieving low complexity maximum likelihood detection for the 3d mimo code":
    also connected through other hyperedges:
      (none)
  Member "construction of block orthogonal stbcs and reducing their sphere decoding complexity":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a survey on mimo transmission with discrete input signals technical challenges advances and future trends")
  Member "fast decodable asymmetric space time codes from division algebras":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a survey on mimo transmission with discrete input signals technical challenges advances and future trends")
  Member "iterated space time code constructions from cyclic algebras":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a survey on mimo transmission with discrete input signals technical challenges advances and future trends")
  Member "a family of fast decodable mido codes from crossed product algebras over q":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "bounds on fast decodability of space time block codes skew hermitian matrices and azumaya algebras")
  Member "block orthogonal space time code structure and its impact on qrdm decoding complexity reduction":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "a survey on mimo transmission with discrete input signals technical challenges advances and future trends")
  Member "optimization of fast decodable full rate stbc with non vanishing determinants":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "a new family of low complexity stbcs for four transmit antennas")
  Member "quadratic forms and space time block codes from generalized quaternion and biquaternion algebras":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "fast decodable space time codes for the n relay and multiple access mimo channel")

Question: Please tell me which class the source paper 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)