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 "a direct and generalized construction of polyphase complementary set with low pmepr and high code rate for ofdm system"):
  Abstract: A salient disadvantage of orthogonal frequency division multiplexing (OFDM) systems is the high peak-to-mean envelope power ratio (PMEPR). The PMEPR problem can be solved by using complementary sequences with low PMEPR but it may suffer from low code rate if the number of complementary sequences is small. In this paper, we present a new construction of complementary set (CS) by using generalized Boolean functions (GBFs), which generalizes Schmidt's construction, Paterson's construction and Golay complementary pair (GCP) given by Davis and Jedwab. The proposed CS provides lower PMEPR with higher code rate compared with Schmidt's method for the sequences corresponding to higher order (>=3) GBFs. We obtain complementary sequences with maximum PMEPR of 2^{k+1} and 2^{k+2}-2M where k, M are non-negative integers that can be easily derived from the GBF associated with the CS.

Includes members:
  Member "optimal z complementary code set from generalized reed muller codes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "generalized constructions of complementary sets of sequences of lengths non power of two")
  Member "complementary sets generalized reed muller codes and power control for ofdm":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "new constructions of cross z complementary pairs")

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)