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: "coded modulation for power line communications"
  Abstract: We discuss the application of coded modulation for power-line communications. We combine M-ary FSK with diversity and coding to make the transmission robust against permanent frequency disturbances and impulse noise. We give a particular example of the coding/modulation scheme that is in agreement with the existing CENELEC norms. The scheme can be considered as a form of coded Frequency Hopping and is thus extendable to any frequency range.

Connected through hyperedge HE-1 (induced by source paper "ulam sphere size analysis for permutation and multipermutation codes correcting translocation errors"):
  with members:
    - "multipermutation ulam sphere analysis toward characterizing maximal code size"
    - "new bounds for permutation codes in ulam metric"
    - "linear programming upper bounds on permutation code sizes from coherent configurations related to the kendall tau distance metric"
    - "error correction in flash memories via codes in the ulam metric"
    - "codes in permutations and error correction for rank modulation"
    - "lp decodable permutation codes based on linearly constrained permutation matrices"

Connected through hyperedge HE-2 (induced by source paper "new bounds of permutation codes under hamming metric and kendall s tau metric"):
  with members:
    - "error correction in flash memories via codes in the ulam metric"
    - "constructions of rank modulation codes"
    - "codes in permutations and error correction for rank modulation"
    - "correcting limited magnitude errors in the rank modulation scheme"

Connected through hyperedge HE-3 (induced by source paper "product construction of affine codes"):
  with members:
    - "irregular product codes"

Connected through hyperedge HE-4 (induced by source paper "lp decodable multipermutation codes"):
  with members:
    - "the admm penalized decoder for ldpc codes"
    - "admm lp decoding of non binary ldpc codes in mathbb f _ 2 m"
    - "multipermutation codes in the ulam metric for nonvolatile memories"
    - "systematic error correcting codes for rank modulation"
    - "error correction in flash memories via codes in the ulam metric"
    - "decomposition methods for large scale lp decoding"
    - "snake in the box codes for rank modulation"
    - "constructions of rank modulation codes"

Connected through hyperedge HE-5 (induced by source paper "importance of symbol equity in coded modulation for power line communications"):
  with members:
    - "estimates on the size of symbol weight codes"
    - "linear size optimal q ary constant weight codes and constant composition codes"
    - "the pbd closure of constant composition codes"

Connected through hyperedge HE-6 (induced by source paper "multipermutation codes in the ulam metric for nonvolatile memories"):
  with members:
    - "computing the ball size of frequency permutations under chebyshev distance"
    - "correcting limited magnitude errors in the rank modulation scheme"

Connected through hyperedge HE-7 (induced by source paper "protocol coding through reordering of user resources part i capacity results"):
  with members:
    - "bits through deterministic relay cascades with half duplex constraint"
    - "bits through relay cascades with half duplex constraint"

Connected through hyperedge HE-8 (induced by source paper "protocol coding through reordering of user resources part ii practical coding strategies"):
  with members:
    - "protocol coding through reordering of user resources part i capacity results"

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)