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: "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.

Connected through hyperedge HE-1 (induced by source paper "on the decoding of barnes wall lattices"):
  with members:
    - "multilevel constructions coding packing and geometric uniformity"
    - "soft decision decoding of reed muller codes recursive lists"
    - "finite dimensional infinite constellations"
    - "practical encoders and decoders for euclidean codes from barnes wall lattices"
    - "list decoding barnes wall lattices"
    - "low density lattice codes"

Connected through hyperedge HE-2 (induced by source paper "repeat accumulate signal codes"):
  with members:
    - "on the design of multi dimensional irregular repeat accumulate lattice codes"
    - "leech constellations of construction a lattices"
    - "threshold improvement of low density lattice codes via spatial coupling"
    - "design and analysis of nonbinary ldpc codes for arbitrary discrete memoryless channels"

Connected through hyperedge HE-3 (induced by source paper "leech constellations of construction a lattices"):
  with members:
    - "some goodness properties of lda lattices"
    - "encoding and indexing of lattice codes"
    - "lda lattices without dithering achieve capacity on the gaussian channel"
    - "low dimensional shaping for high dimensional lattice codes"
    - "construction of capacity achieving lattice codes polar lattices"
    - "achieving awgn channel capacity with lattice gaussian coding"
    - "on the performance of 1 level ldpc lattices"
    - "finite dimensional infinite constellations"

Connected through hyperedge HE-4 (induced by source paper "lda lattices without dithering achieve capacity on the gaussian channel"):
  with members:
    - "some goodness properties of lda lattices"
    - "ldpc lattice codes for full duplex relay channels"
    - "construction of capacity achieving lattice codes polar lattices"
    - "lattices over eisenstein integers for compute and forward"
    - "achieving awgn channel capacity with lattice gaussian coding"
    - "on the performance of 1 level ldpc lattices"
    - "spatially coupled ensembles universally achieve capacity under belief propagation"
    - "a simple proof for the existence of good pairs of nested lattices"

Connected through hyperedge HE-5 (induced by source paper "encoding and indexing of lattice codes"):
  with members:
    - "phase precoded compute and forward with partial feedback"
    - "connections between construction d and related constructions of lattices"
    - "an algebraic approach to physical layer network coding"
    - "a simple proof for the existence of good pairs of nested lattices"
    - "compute and forward harnessing interference through structured codes"
    - "low density lattice codes"

Connected through hyperedge HE-6 (induced by source paper "bounds for the l_1 distance of q ary lattices obtained via constructions d d and overline d"):
  with members:
    - "unshared secret key cryptography"
    - "coding for the lee and manhattan metrics with weighing matrices"

Connected through hyperedge HE-7 (induced by source paper "lattices from codes over mathbb z _q generalization of constructions d d and overline d"):
  with members:
    - "construction pi_a and pi_d lattices construction goodness and decoding algorithms"
    - "connections between construction d and related constructions of lattices"

Connected through hyperedge HE-8 (induced by source paper "connections between construction d and related constructions of lattices"):
  with members:
    - "practical encoders and decoders for euclidean codes from barnes wall lattices"
    - "lattice codes for the gaussian wiretap channel"

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)