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 "construction of const dimension codes from serval parallel lift mrd code"):
  Abstract: In this paper, we generalize the method of using two parallel versions of the lifted MRD code from the existing work [1]. The Delsarte theorem of the rank distribution of MRD codes is an important part to count codewords in our construction. We give a new generalize construction to the following bounds: if n>=k>=d, then $Aq(n + k,k,d)>=q^{n(k-\frac{d}{2}+1)}+\sum_{r=\frac{d}{2}}^{k-\frac{d}{2}} A_r(Q_q(n,k,\frac{d}{2})).$ On this basis, we also give a construction of constant-dimension subspace codes from several parallel versions of lifted MRD codes. This construction contributes to a new lower bounds for Aq((s+1)k+n,d,k).

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 "rank distribution of delsarte codes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "new constructions of subspace codes using subsets of mrd codes in several blocks")
  Member "subspace codes based on graph matchings ferrers diagrams and pending blocks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "distance distributions of cyclic orbit codes")
  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 "coding for errors and erasures in random network coding":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "on the gap between scalar and vector solutions of generalized combination networks")
  Member "johnson type bounds on constant dimension codes":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "the lattice structure of linear subspace 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)