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 geometric characterization of minimal codes and their asymptotic performance"):
  Abstract: In this paper, we give a geometric characterization of minimal linear codes. In particular, we relate minimal linear codes to cutting blocking sets, introduced in a recent paper by Bonini and Borello. Using this characterization, we derive some bounds on the length and the distance of minimal codes, according to their dimension and the underlying field size. Furthermore, we show that the family of minimal codes is asymptotically good. Finally, we provide some geometrical constructions of minimal codes.

Includes members:
  Member "an inductive construction of minimal codes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "full characterization of minimal linear codes as cutting blocking sets")
  Member "minimal linear codes arising from blocking sets":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "full characterization of minimal linear codes as cutting blocking sets")
  Member "full characterization of minimal linear codes as cutting blocking sets":
    also connected through other hyperedges:
      (none)
  Member "group codes over fields are asymptotically good":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "asymptotic performance of metacyclic codes")
  Member "several classes of minimal linear codes with few weights from weakly regular plateaued functions":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "strongly regular graphs from weakly regular plateaued functions")
  Member "minimal linear codes over finite fields":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "minimal linear codes constructed from functions")
  Member "long quasi polycyclic t cis codes":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "asymptotically good additive cyclic codes exist")
  Member "on self dual double circulant codes":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "asymptotic performance of metacyclic 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)