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 "on sigma lcd codes"):
  Abstract: Linear complementary pairs (LCP) of codes play an important role in armoring implementations against side-channel attacks and fault injection attacks. One of the most common ways to construct LCP of codes is to use Euclidean linear complementary dual (LCD) codes. In this paper, we first introduce the concept of linear codes with $\sigma$ complementary dual ($\sigma$-LCD), which includes known Euclidean LCD codes, Hermitian LCD codes, and Galois LCD codes. #R##N#As Euclidean LCD codes, $\sigma$-LCD codes can also be used to construct LCP of codes. We show that, for $q > 2$, all q-ary linear codes are $\sigma$-LCD and that, for every binary linear code $\mathcal C$, the code $\{0\}\times \mathcal C$ is $\sigma$-LCD. Further, we study deeply $\sigma$-LCD generalized quasi-cyclic (GQC) codes. In particular, we provide characterizations of $\sigma$-LCD GQC codes, self-orthogonal GQC codes and self-dual GQC codes, respectively. Moreover, we provide constructions of asymptotically good $\sigma$-LCD GQC codes. Finally, we focus on $\sigma$-LCD Abelian codes and prove that all Abelian codes in a semi-simple group algebra are $\sigma$-LCD. #R##N#The results derived in this paper extend those on the classical LCD codes and show that $\sigma$-LCD codes allow the construction of LCP of codes more easily and with more flexibility.

Includes members:
  Member "on hermitian lcd codes from cyclic codes and their applications to orthogonal direct sum masking":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "euclidean and hermitian lcd mds codes")
  Member "structure and performance of generalized quasi cyclic codes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "do non free lcd codes over finite commutative frobenius rings exist")
  Member "linear codes over fq which are equivalent to lcd codes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "binary lcd codes from mathbb z _2 mathbb z _2 u")
  Member "euclidean and hermitian lcd mds codes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "galois hulls of mds codes and their quantum error correction")
  Member "new characterization and parametrization of lcd codes":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "galois hulls of mds codes and their quantum error correction")
  Member "galois lcd codes over finite fields":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "constructions of quantum mds codes")
  Member "complementary dual subfield linear codes over finite fields":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "do non free lcd codes over finite commutative frobenius rings exist")
  Member "complementary dual algebraic geometry codes":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "minimal linear codes from characteristic functions")

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)