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: "on the decoding complexity of cyclic codes up to the bch bound"
  Abstract: The standard algebraic decoding algorithm of cyclic codes [n, k, d] up to the BCH bound δ = 2t + 1 is very efficient and practical for relatively small n while it becomes unpractical for large n as its computational complexity is O(nt). Aim of this paper is to show how to make this algebraic decoding computationally more efficient: in the case of binary codes, for example, the complexity of the syndrome computation drops from O(nt) to O(t√n), while the average complexity of the error location drops from O(nt) to max{O(t√n),O(t log2(t) log log(t) log(n))}.

Connected through hyperedge HE-1 (induced by source paper "fec assisted parallel decoding of polar coded frames design considerations"):
  with members:
    - "performance limits and practical decoding of interleaved reed solomon polar concatenated codes"
    - "list decoding of polar codes"
    - "concatenated polar codes"

Connected through hyperedge HE-2 (induced by source paper "on the shape of the general error locator polynomial for cyclic codes"):
  with members:
    - "multivariate interpolation formula over finite fields and its applications in coding theory"

Connected through hyperedge HE-3 (induced by source paper "on burst error correction and storage security of noisy data"):
  with members:
    - "on fuzzy syndrome hashing with ldpc coding"
    - "fuzzy extractors how to generate strong keys from biometrics and other noisy data"
    - "coding solutions for the secure biometric storage problem"

Connected through hyperedge HE-4 (induced by source paper "enhanced public key security for the mceliece cryptosystem"):
  with members:
    - "security and complexity of the mceliece cryptosystem based on quasi cyclic low density parity check codes"
    - "distinguisher based attacks on public key cryptosystems using reed solomon codes"
    - "optimization of the parity check matrix density in qc ldpc code based mceliece cryptosystems"
    - "an efficient cca2 secure variant of the mceliece cryptosystem in the standard model"
    - "improving the efficiency of the ldpc code based mceliece cryptosystem through irregular codes"
    - "a distinguisher based attack on a variant of mceliece s cryptosystem based on reed solomon codes"
    - "a cca2 secure variant of the mceliece cryptosystem"
    - "error correcting pairs for a public key cryptosystem"

Connected through hyperedge HE-5 (induced by source paper "on fuzzy syndrome hashing with ldpc coding"):
  with members:
    - "fuzzy extractors how to generate strong keys from biometrics and other noisy data"
    - "optimal iris fuzzy sketches"
    - "coding solutions for the secure biometric storage problem"

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)