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 "impact of interleaver pruning on properties of underlying permutations"):
  Abstract: In this paper we address the issue of pruning (i.e., shortening) a given interleaver via truncation of the transposition vector of the mother permutation and study its impact on the structural properties of the permutation. This method of pruning allows for continuous un-interrupted data flow regardless of the permutation length since the permutation engine is a buffer whose leading element is swapped by other elements in the queue. The principle goal of pruning is that of construction of variable length and hence delay interleavers with application to iterative soft information processing and concatenated codes, using the same structure (possibly in hardware) of the interleaver and deinterleaver units. We address the issue of how pruning impacts the spread of the permutation and also look at how pruning impacts algebraically constructed permutations. We note that pruning via truncation of the transposition vector of the permutation can have a catastrophic impact on the permutation spread of algebraically constructed permutations. To remedy this problem, we propose a novel lifting method whereby a subset of the points in the permutation map leading to low spread of the pruned permutation are identified and eliminated. Practical realization of this lifting is then proposed via dummy symbol insertion in the input queue of the Finite State Permuter (FSP), and subsequent removal of the dummy symbols at the FSP output.

Includes members:
  Member "pruned bit reversal permutations mathematical characterization fast algorithms and architectures":
    also connected through other hyperedges:
      (none)
  Member "on quadratic inverses for quadratic permutation polynomials over integer rings":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "parallel interleaver design for a high throughput hspa lte multi standard turbo decoder")

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)