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 "the subfield codes of hyperoval and conic codes"):
  Abstract: Hyperovals in $\PG(2,\gf(q))$ with even $q$ are maximal arcs and an interesting research topic in finite geometries and combinatorics. Hyperovals in $\PG(2,\gf(q))$ are equivalent to $[q+2,3,q]$ MDS codes over $\gf(q)$, called hyperoval codes, in the sense that one can be constructed from the other. Ovals in $\PG(2,\gf(q))$ for odd $q$ are equivalent to $[q+1,3,q-1]$ MDS codes over $\gf(q)$, which are called oval codes. In this paper, we investigate the binary subfield codes of two families of hyperoval codes and the $p$-ary subfield codes of the conic codes. The weight distributions of these subfield codes and the parameters of their duals are determined. As a byproduct, we generalize one family of the binary subfield codes to the $p$-ary case and obtain its weight distribution. The codes presented in this paper are optimal or almost optimal in many cases. In addition, the parameters of these binary codes and $p$-ary codes seem new.

Includes members:
  Member "the subfield codes of ovoid codes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "optimal binary linear codes from maximal arcs")
  Member "binary linear codes from vectorial boolean functions and their weight distribution":
    also connected through other hyperedges:
      (none)
  Member "linear codes from some 2 designs":
    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 "five constructions of permutation polynomials over gf q 2":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a construction of binary linear codes from boolean functions")
  Member "lossy compression via sparse linear regression computationally efficient encoding and decoding":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "sparse regression 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)