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 "how many weights can a cyclic code have"):
  Abstract: Upper and lower bounds on the largest number of weights in a cyclic code of given length, dimension and alphabet are given. An application to irreducible cyclic codes is considered. Sharper upper bounds are given for the special cyclic codes (called here strongly cyclic), {whose nonzero codewords have period equal to the length of the code}. Asymptotics are derived on the function $\Gamma(k,q),$ {that is defined as} the largest number of nonzero weights a cyclic code of dimension $k$ over $\F_q$ can have, and an algorithm to compute it is sketched. The nonzero weights in some infinite families of Reed-Muller codes, either binary or $q$-ary, as well as in the $q$-ary Hamming code are determined, two difficult results of independent interest.

Includes members:
  Member "how many weights can a linear code have":
    also connected through other hyperedges:
      (none)
  Member "maximum weight spectrum codes with reduced length":
    also connected through other hyperedges:
      (none)
  Member "a note on full weight spectrum codes":
    also connected through other hyperedges:
      (none)
  Member "maximum weight spectrum codes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a note on full weight spectrum codes")
  Member "two weight codes and second order recurrences":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "two weight codes over the integers modulo a prime power")
  Member "the weights in mds codes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on the text ac 0 oplus complexity of andreev s problem")
  Member "hamming weights in irreducible cyclic codes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a class of narrow sense bch codes")
  Member "weight distributions of hamming codes ii":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "spectral algorithms for unique games")

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)