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 "an algebraic approach to source coding with side information using list decoding"):
  Abstract: Existing literature on source coding with side information (SCSI) mostly uses the state-of-the-art channel codes namely LDPC codes, turbo codes, and their variants and assume classical unique decoding. In this paper, we present an algebraic approach to SCSI based on the list decoding of the underlying channel codes. We show that the theoretical limit of SCSI can be achieved in the proposed list decoding based framework when the correlation between the source and side information is $q$-ary symmetric. We argue that, as opposed to channel coding, the correct sequence from the list produced by the list decoder can effectively be recovered in case of SCSI with a few CRC symbols. The CRC symbols, which allow the decoder to identify the correct sequence, incur negligible overhead for large block lengths. More importantly, these CRC symbols are not subject to noise since we are dealing with a virtual noisy channel rather than a real noisy channel. Finally, we present a guideline for designing constructive SCSI schemes for non-binary and binary sources using Reed Solomon codes and BCH codes, respectively. This guideline allows us to design a SCSI scheme for any arbitrary $q$-ary symmetric correlation without resorting to simulation.

Includes members:
  Member "algebraic codes for slepian wolf code design":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "efficient joint network source coding for multiple terminals with side information")
  Member "on the list decodability of random linear codes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "ldpc codes achieve list decoding capacity")
  Member "source coding with side information using list decoding":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "hiding symbols and functions new metrics and constructions for information theoretic security")
  Member "new list decoding algorithms for reed solomon and bch codes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "reed solomon codes over fields of characteristic zero")

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)