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 "systematic encoders for generalized gabidulin codes and the q analogue of cauchy matrices"):
  Abstract: We characterize the generator matrix in standard form of generalized Gabidulin codes. The parametrization we get for the non-systematic part of this matrix coincides with the $q$-analogue of generalized Cauchy matrices, leading to the definition of generalized rank Cauchy matrices. These matrices can be represented very conveniently and their representation allows to define new interesting subfamilies of generalized Gabidulin codes whose generator matrix is a structured matrix. In particular, as an application, we construct Gabidulin codes whose generator matrix is the concatenation of an identity block and a Toeplitz/Hankel matrix. In addition, our results allow to give a new efficient criterion to verify whether a rank metric code of dimension $k$ and length $n$ is a generalized Gabidulin code. This criterion is only based on the computation of the rank of one matrix and on the verification of the linear independence of two sets of elements and it requires $\mathcal O(k^2n)$ field operations.

Includes members:
  Member "systematic maximum sum rank codes":
    also connected through other hyperedges:
      (none)
  Member "equivalence and characterizations of linear rank metric codes based on invariants":
    also connected through other hyperedges:
      (none)
  Member "random construction of partial mds codes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "roos bound for skew cyclic codes in hamming and rank metric")
  Member "partition balanced families of codes and asymptotic enumeration in coding theory":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "mathbb f _ q n linear rank distance codes and their distinguishers")
  Member "on the genericity of maximum rank distance and gabidulin codes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "equivalence and characterizations of linear rank metric codes based on invariants")
  Member "generalized gabidulin codes over fields of any characteristic":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "roos bound for skew cyclic codes in hamming and rank metric")
  Member "fuzzy authentication using rank distance":
    also connected through other hyperedges:
      (none)
  Member "new criteria for mrd and gabidulin codes and some rank metric code constructions":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "decoding high order interleaved rank metric 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)