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 "mathbb f _ q n linear rank distance codes and their distinguishers"):
  Abstract: For any admissible value of the parameters there exist Maximum Rank distance (shortly MRD) $\mathbb{F}_{q^n}$-linear codes of $\mathbb{F}_q^{n\times n}$. It has been shown in \cite{H-TNRR} (see also \cite{ByrneRavagnani}) that, if field extensions large enough are considered, then \emph{almost all} (rectangular) rank distance codes are MRD. On the other hand, very few families of $\mathbb{F}_{q^n}$-linear codes are currently known up to equivalence. One of the possible applications of MRD-codes is for McEliece--like public key cryptosystems, as proposed by Gabidulin, Paramonov and Tretjakov in \cite{GPT}. In this framework it is very important to obtain new families of MRD-codes endowed with fast decoding algorithms. Several decoding algorithms exist for Gabidulin codes as shown in \cite{Gabidulin}, see also \cite{Loi06,PWZ,WT}. In this work, we will survey the known families of $\mathbb{F}_{q^n}$-linear MRD-codes, study some invariants of MRD-codes and evaluate their value for the known families, providing a characterization of generalized twisted Gabidulin codes as done in \cite{GiuZ}.

Includes members:
  Member "partition balanced families of codes and asymptotic enumeration in coding theory":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on the list decodability of rank metric codes")
  Member "on the genericity of maximum rank distance and gabidulin codes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "equivalence and characterizations of linear rank metric codes based on invariants")
  Member "new criteria for mrd and gabidulin codes and some rank metric code constructions":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "decoding high order interleaved rank metric codes")
  Member "automorphism groups of gabidulin like codes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "on the list decodability of rank metric codes")
  Member "fast operations on linearized polynomials and their applications in coding theory":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "decoding high order interleaved rank metric codes")
  Member "rank metric codes and their duality theory":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "degenerate flag varieties in network coding")
  Member "equivalence for rank metric and matrix codes and automorphism groups of gabidulin codes":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "equivalence and characterizations of linear rank metric codes based on invariants")

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)