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 "turbo lattices construction and error decoding performance"):
  Abstract: In this paper a new class of lattices called turbo lattices is introduced and established. We use the lattice Con- struction D to produce turbo lattices. This method needs a set of nested linear codes as its underlying structure. We benefi t from turbo codes as our basis codes. Therefore, a set of nested turbo codes based on nested interleavers (block interleavers) and nested convolutional codes is built. To this end, we employ both tail-biting and zero-tail convolutional codes. Using these codes, along with construction D, turbo lattices are created. Several properties of Construction D lattices and fundamental characteristics of turbo lattices including the minimum distance, coding gain and kissing number are investigated. Furthermore, a multi-stage turbo lattice decoding algorithm based on iterative turbo decoding algorithm is given. We show, by simulation, that turbo lattices attain good error performance within � 1.25 dB from capacity at block length of n = 1035. Also an excellent performance of only � .5 dB away from capacity at SER of 10 5 is achieved for size n = 10131.

Includes members:
  Member "practical encoders and decoders for euclidean codes from barnes wall lattices":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on the decoding of barnes wall lattices")
  Member "cycle structure of permutation functions over finite fields and their applications":
    also connected through other hyperedges:
      (none)
  Member "low density lattice codes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "neural fuzzy extractors a secure way to use artificial neural networks for biometric user authentication")
  Member "on quasi cyclic interleavers for parallel turbo codes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "cycle structure of permutation functions over finite fields and their applications")

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)