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 "linear complementary dual maximum distance separable codes"):
  Abstract: Linear complementary dual (LCD) maximum distance separable (MDS) codes are constructed to given specifications. For given $n$ and $r<n$, with $n$ or $r$ (or both) odd, MDS LCD $(n,r)$ codes are constructed over finite fields whose characteristic does not divide $n$. Series of LCD MDS codes are constructed to required rate and required error-correcting capability. Given the field $GF(q)$ and $n/(q-1)$, LCD MDS codes of length $n$ and dimension $r$ are explicitly constructed over $GF(q)$ for all $r<n$ when $n$ is odd and for all odd $r<n$ when $n$ is even. For given dimension and given error-correcting capability LCD MDS codes are constructed to these specifications with smallest possible length. Series of asymptotically good LCD MDS codes are explicitly constructed. Efficient encoding and decoding algorithms exist for all the constructed codes. #R##N#Linear complementary dual codes have importance in data storage, communications' systems and security.

Includes members:
  Member "coding theory the unit derived methodology":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "constructions of quantum mds codes")
  Member "linear codes over fq which are equivalent to lcd codes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "binary lcd codes from mathbb z _2 mathbb z _2 u")
  Member "new characterization and parametrization of lcd codes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "galois hulls of mds codes and their quantum error correction")
  Member "complementary dual algebraic geometry codes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "minimal linear codes from characteristic functions")
  Member "systems of mds codes from units and idempotents":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "maximum distance separable codes to order")
  Member "codes from zero divisors and units in group rings":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "maximum distance separable codes to order")

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)