human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "improved constructions of nested code pairs"
  Abstract: Two new constructions of linear code pairs $C_2 \subset C_1$ are given for which the codimension and the relative minimum distances $M_1(C_1,C_2)$, $M_1(C_2^\perp,C_1^\perp)$ are good. By this we mean that for any two out of the three parameters the third parameter of the constructed code pair is large. Such pairs of nested codes are indispensable for the determination of good linear ramp secret sharing schemes [35]. They can also be used to ensure reliable communication over asymmetric quantum channels [47]. The new constructions result from carefully applying the Feng-Rao bounds [18,27] to a family of codes defined from multivariate polynomials and Cartesian product point sets.

Connected through hyperedge HE-1 (induced by source paper "on steane enlargement of quantum codes from cartesian product point sets"):
  with members:
    - "steane enlargement of quantum codes from the hermitian curve"
    - "monomial cartesian codes and their duals with applications to lcd codes quantum codes and locally recoverable codes"
    - "quantum error correcting codes from algebraic geometry codes of castle type"
    - "on cyclotomic cosets and code constructions"
    - "stabilizer quantum codes from j affine variety codes and a new steane like enlargement"

Connected through hyperedge HE-2 (induced by source paper "new binary and ternary lcd codes"):
  with members:
    - "linear codes over fq which are equivalent to lcd codes"
    - "euclidean and hermitian lcd mds codes"
    - "on the distance of stabilizer quantum codes from j affine variety codes"
    - "lcd cyclic codes over finite fields"
    - "stabilizer quantum codes from j affine variety codes and a new steane like enlargement"
    - "quantum codes from affine variety codes and their subfield subcodes"
    - "new quantum codes from evaluation and matrix product codes"
    - "linearity and complements in projective space"

Question: Please tell me which class the center node 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)