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: "decoding generalized concatenated codes using interleaved reed solomon codes"
  Abstract: Generalized Concatenated codes are a code construction consisting of a number of outer codes whose code symbols are protected by an inner code. As outer codes, we assume the most frequently used Reed-Solomon codes; as inner code, we assume some linear block code which can be decoded up to half its minimum distance. Decoding up to half the minimum distance of Generalized Concatenated codes is classically achieved by the Blokh-Zyablov-Dumer algorithm, which iteratively decodes by first using the inner decoder to get an estimate of the outer code words and then using an outer error/erasure decoder with a varying number of erasures determined by a set of pre- calculated thresholds. In this paper, a modified version of the Blokh-Zyablov-Dumer algorithm is proposed, which exploits the fact that a number of outer Reed-Solomon codes with average minimum distance d macr can be grouped into one single Interleaved Reed-Solomon code which can be decoded beyond d macr/2. This allows to skip a number of decoding iterations on the one hand and to reduce the complexity of each decoding iteration significantly - while maintaining the decoding performance - on the other.

Connected through hyperedge HE-1 (induced by source paper "optimal threshold based multi trial error erasure decoding with the guruswami sudan algorithm"):
  with members:
    - "on multiple decoding attempts for reed solomon codes a rate distortion approach"
    - "optimal thresholds for gmd decoding with l 1 over l extended bounded distance decoders"
    - "on generalized minimum distance decoding thresholds for the awgn channel"

Connected through hyperedge HE-2 (induced by source paper "optimal thresholds for gmd decoding with l 1 over l extended bounded distance decoders"):
  with members:
    - "on generalized minimum distance decoding thresholds for the awgn channel"
    - "collaborative decoding of interleaved reed solomon codes and concatenated code designs"

Connected through hyperedge HE-3 (induced by source paper "adaptive single trial error erasure decoding for binary codes"):
  with members:
    - "optimal thresholds for gmd decoding with l 1 over l extended bounded distance decoders"
    - "on generalized minimum distance decoding thresholds for the awgn channel"

Connected through hyperedge HE-4 (induced by source paper "collaborative decoding of interleaved reed solomon codes and concatenated code designs"):
  with members:
    - "linear shift register synthesis for multiple sequences of varying length"

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)