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 "relative generalized hamming weights of cyclic codes"):
  Abstract: Relative generalized Hamming weights (RGHWs) of a linear code respect to a linear subcode determine the security of the linear ramp secret sharing scheme based on the code. They can be used to express the information leakage of the secret when some keepers of shares are corrupted. Cyclic codes are an interesting type of linear codes and have wide applications in communication and storage systems. In this paper, we investigate the RGHWs of cyclic codes with two nonzeros respect to any of its irreducible cyclic subcodes. Applying the method in the paper [arxiv.org/abs/1410.2702], we give two formulae for RGHWs of the cyclic codes. As applications of the formulae, explicit examples are computed.

Includes members:
  Member "on asymptotically good ramp secret sharing schemes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "subquadratic time encodable codes beating the gilbert varshamov bound")
  Member "the weight hierarchy of some reducible cyclic codes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "weight distributions and weight hierarchies of two classes of binary linear codes")
  Member "relative generalized hamming weights of q ary reed muller codes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "relative generalized hamming weights of affine cartesian codes")
  Member "generalized hamming weights of irreducible cyclic codes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "weight distributions and weight hierarchies of two classes of binary linear codes")
  Member "relative generalized hamming weights of one point algebraic geometric codes":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "on asymptotically good ramp secret sharing schemes")
  Member "weight distributions of cyclic codes with respect to pairwise coprime order elements":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "a class of functions with low valued walsh spectrum")
  Member "the weight distribution of a class of cyclic codes related to hermitian forms graphs":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "optimal cyclic codes with generalized niho type zeroes and the weight distribution")
  Member "a class of three weight cyclic codes":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "a class of narrow sense bch codes")

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)