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: "coding theory the unit derived methodology"
  Abstract: The unit-derived method in coding theory is shown to be a unique optimal scheme for constructing and analysing codes. In many cases efficient and practical decoding methods are produced. Codes with efficient decoding algorithms at maximal distances possible are derived from unit schemes. In particular unit-derived codes from Vandermonde or Fourier matrices are particularly commendable giving rise to mds codes of varying rates with practical and efficient decoding algorithms. For a given rate and given error correction capability, explicit codes with efficient error correcting algorithms are designed to these specifications. An explicit constructive proof with an efficient decoding algorithm is given for Shannon's theorem. For a given finite field, codes are constructed which are `optimal' for this field.

Connected through hyperedge HE-1 (induced by source paper "constructions of quantum mds codes"):
  with members:
    - "some new constructions of quantum mds codes"
    - "mds codes with arbitrary dimensional hull and their applications"
    - "galois lcd codes over finite fields"
    - "new mds self dual codes from generalized reed solomon codes"
    - "a construction of new quantum mds codes"

Connected through hyperedge HE-2 (induced by source paper "a new method for constructing eaqec mds codes"):
  with members:
    - "new entanglement assisted mds quantum codes from constacyclic codes"
    - "entanglement assisted quantum mds codes from constacyclic codes with large minimum distance"
    - "new mds self dual codes from generalized reed solomon codes"
    - "application of constacyclic codes to quantum mds codes"
    - "entanglement assisted quantum low density parity check codes"

Connected through hyperedge HE-3 (induced by source paper "maximum distance separable codes to order"):
  with members:
    - "linear complementary dual maximum distance separable codes"
    - "entanglement assisted quantum error correcting codes from units"
    - "solving underdetermined systems with error correcting codes"
    - "systems of mds codes from units and idempotents"
    - "codes from zero divisors and units in group rings"

Connected through hyperedge HE-4 (induced by source paper "linear complementary dual maximum distance separable codes"):
  with members:
    - "linear codes over fq which are equivalent to lcd codes"
    - "new characterization and parametrization of lcd codes"
    - "complementary dual algebraic geometry codes"
    - "systems of mds codes from units and idempotents"
    - "codes from zero divisors and units in group rings"

Connected through hyperedge HE-5 (induced by source paper "mds codes over finite fields"):
  with members:
    - "systems of mds codes from units and idempotents"
    - "codes from zero divisors and units in group rings"

Connected through hyperedge HE-6 (induced by source paper "quantum error correcting codes the unit derived strategy"):
  with members:
    - "systems of mds codes from units and idempotents"
    - "codes from zero divisors and units in group rings"
    - "self dual dual containing and related quantum codes from group rings"

Connected through hyperedge HE-7 (induced by source paper "entanglement assisted quantum error correcting codes from units"):
  with members:
    - "constructions of good entanglement assisted quantum error correcting codes"

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)