{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:EWJCUY2BV634V5F6DOJ64JME7I","short_pith_number":"pith:EWJCUY2B","schema_version":"1.0","canonical_sha256":"25922a6341afb7caf4be1b93ee2584fa10b5b48af70702ef87556e9a11d11896","source":{"kind":"arxiv","id":"1108.1873","version":3},"attestation_state":"computed","paper":{"title":"Turbo Lattices: Construction and Error Decoding Performance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Amin Sakzad, Daniel Panario, Mohammad-Reza Sadeghi","submitted_at":"2011-08-09T07:45:50Z","abstract_excerpt":"In this paper a new class of lattices called turbo lattices is introduced and established. We use the lattice Construction D to produce turbo lattices. This method needs a set of nested linear codes as its underlying structure. We benefit 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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1108.1873","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-08-09T07:45:50Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"72fd0744c94f1f815fae0046a335245b05f562f5bf0516d90277d92914ba497c","abstract_canon_sha256":"1bdc1086c6095e12b35ee944d4a378b86034de58f84da088e868a5a0d84933a2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:44:33.925541Z","signature_b64":"z8LKQfl1CTblZaEUqfxM8CAcDsRgTbYx2MbvRIl+dTn+0M40GXPcEJxR+h2EKWpWRj6j7k2FJgqOmLNgD9uQCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"25922a6341afb7caf4be1b93ee2584fa10b5b48af70702ef87556e9a11d11896","last_reissued_at":"2026-05-18T03:44:33.924720Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:44:33.924720Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Turbo Lattices: Construction and Error Decoding Performance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Amin Sakzad, Daniel Panario, Mohammad-Reza Sadeghi","submitted_at":"2011-08-09T07:45:50Z","abstract_excerpt":"In this paper a new class of lattices called turbo lattices is introduced and established. We use the lattice Construction D to produce turbo lattices. This method needs a set of nested linear codes as its underlying structure. We benefit 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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.1873","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1108.1873","created_at":"2026-05-18T03:44:33.924858+00:00"},{"alias_kind":"arxiv_version","alias_value":"1108.1873v3","created_at":"2026-05-18T03:44:33.924858+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.1873","created_at":"2026-05-18T03:44:33.924858+00:00"},{"alias_kind":"pith_short_12","alias_value":"EWJCUY2BV634","created_at":"2026-05-18T12:26:28.662955+00:00"},{"alias_kind":"pith_short_16","alias_value":"EWJCUY2BV634V5F6","created_at":"2026-05-18T12:26:28.662955+00:00"},{"alias_kind":"pith_short_8","alias_value":"EWJCUY2B","created_at":"2026-05-18T12:26:28.662955+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EWJCUY2BV634V5F6DOJ64JME7I","json":"https://pith.science/pith/EWJCUY2BV634V5F6DOJ64JME7I.json","graph_json":"https://pith.science/api/pith-number/EWJCUY2BV634V5F6DOJ64JME7I/graph.json","events_json":"https://pith.science/api/pith-number/EWJCUY2BV634V5F6DOJ64JME7I/events.json","paper":"https://pith.science/paper/EWJCUY2B"},"agent_actions":{"view_html":"https://pith.science/pith/EWJCUY2BV634V5F6DOJ64JME7I","download_json":"https://pith.science/pith/EWJCUY2BV634V5F6DOJ64JME7I.json","view_paper":"https://pith.science/paper/EWJCUY2B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1108.1873&json=true","fetch_graph":"https://pith.science/api/pith-number/EWJCUY2BV634V5F6DOJ64JME7I/graph.json","fetch_events":"https://pith.science/api/pith-number/EWJCUY2BV634V5F6DOJ64JME7I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EWJCUY2BV634V5F6DOJ64JME7I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EWJCUY2BV634V5F6DOJ64JME7I/action/storage_attestation","attest_author":"https://pith.science/pith/EWJCUY2BV634V5F6DOJ64JME7I/action/author_attestation","sign_citation":"https://pith.science/pith/EWJCUY2BV634V5F6DOJ64JME7I/action/citation_signature","submit_replication":"https://pith.science/pith/EWJCUY2BV634V5F6DOJ64JME7I/action/replication_record"}},"created_at":"2026-05-18T03:44:33.924858+00:00","updated_at":"2026-05-18T03:44:33.924858+00:00"}