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 "new complementary sets with low papr property under spectral null constraints"):
  Abstract: Complementary set sequences (CSSs) are useful for dealing with the high peak-to-average power ratio (PAPR) problem in orthogonal frequency division multiplexing (OFDM) systems. In practical OFDM transmission, however, certain sub-carriers maybe reserved and/or prohibited to transmit signals, leading to the so-called \emph{spectral null constraint} (SNC) design problem. For example, the DC sub-carrier is reserved to avoid the offsets in D/A and A/D converter in the LTE systems. While most of the current research focus on the design of low PAPR CSSs to improve the code-rate, few works address the aforementioned SNC in their designs. This motivates us to investigate CSSs with SNC as well as low PAPR property. In this paper, we present systematic constructions of CSSs under SNCs and low PAPR. First, we show that mutually orthogonal complementary sets (MOCSs) can be used as \emph{seed sequences} to generate new CSSs with SNC and low PAPR, and then provide an iterative technique for the construction of MOCSs which can be further used to generate complementary sets (CSs) with low PAPRs and spectral nulls at \emph{varying} positions in the designed sequences. Next, inspired by a recent idea of Chen, we propose a novel construction of these \emph{seed} MOCSs with non-power-of-two lengths from generalized Boolean functions.

Includes members:
  Member "sequence design for cognitive cdma communications under arbitrary spectrum hole constraint":
    also connected through other hyperedges:
      (none)
  Member "a systematic framework for the construction of optimal complete complementary codes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "how to construct mutually orthogonal complementary sets with non power of two lengths")
  Member "complementary set matrices satisfying a column correlation constraint":
    also connected through other hyperedges:
      (none)

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)