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 "optimal threshold based multi trial error erasure decoding with the guruswami sudan algorithm"):
  Abstract: Traditionally, multi-trial error/erasure decoding of Reed-Solomon (RS) codes is based on Bounded Minimum Distance (BMD) decoders with an erasure option. Such decoders have error/erasure tradeoff factor λ = 2, which means that an error is twice as expensive as an erasure in terms of the code's minimum distance. The Guruswami-Sudan (GS) list decoder can be considered as state of the art in algebraic decoding of RS codes. Besides an erasure option, it allows to adjust λ to values in the range 1 &#60; λ ≤ 2. Based on previous work [1], we provide formulae which allow to optimally (in terms of residual codeword error probability) exploit the erasure option of decoders with arbitrary λ, if the decoder can be used z ≥ 1 times. We show that BMD decoders with z BMD  decoding trials can result in lower residual codeword error probability than GS decoders with z GS  trials, if z BMD  is only slightly larger than z GS . This is of practical interest since BMD decoders generally have lower computational complexity than GS decoders.

Includes members:
  Member "on multiple decoding attempts for reed solomon codes a rate distortion approach":
    also connected through other hyperedges:
      (none)
  Member "optimal thresholds for gmd decoding with l 1 over l extended bounded distance decoders":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "adaptive single trial error erasure decoding for binary codes")
  Member "on generalized minimum distance decoding thresholds for the awgn channel":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "optimal thresholds for gmd decoding with l 1 over l extended bounded distance decoders")
  Member "decoding generalized concatenated codes using interleaved reed solomon codes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "optimal thresholds for gmd decoding with l 1 over l extended bounded distance decoders")

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)