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 hierarchical based greedy algorithm for echelon ferrers construction"):
  Abstract: Echelon-Ferrers is one of important techniques to help researchers to improve lower bounds for subspace code. Unfortunately, exact computation of echelon ferrers construction is limited by the computation time. In this paper, we show how to attain codes of larger size for a given minimum distance d=4 or 6 by the hierarchical-based greedy algorithm for echelon-ferrers introduced in [6]. About $63$ new constant-dimension subspace codes are better than previously best known codes.

Includes members:
  Member "construction of subspace codes through linkage":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "distance distributions of cyclic orbit codes")
  Member "subspace codes based on graph matchings ferrers diagrams and pending blocks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "distance distributions of cyclic orbit codes")
  Member "subspace codes from ferrers diagrams":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on some automorphisms of rational functions and their applications in rank metric codes")
  Member "problems on q analogs in coding theory":
    also connected through other hyperedges:
      (none)
  Member "error correcting codes in projective spaces via rank metric codes and ferrers diagrams":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a note on echelon ferrers construction")
  Member "a rank metric approach to error control in random network coding":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "roos bound for skew cyclic codes in hamming and rank metric")
  Member "coding for errors and erasures in random network coding":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "on the gap between scalar and vector solutions of generalized combination networks")

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)