{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:L4LUVKIV4VVQFJMDECGFZ5KSUT","short_pith_number":"pith:L4LUVKIV","schema_version":"1.0","canonical_sha256":"5f174aa915e56b02a583208c5cf552a4c82d2623539ebd9146ec1c7661d87727","source":{"kind":"arxiv","id":"1505.01944","version":1},"attestation_state":"computed","paper":{"title":"Optimization Design and Analysis of Systematic LT codes over AWGN Channel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Dazhuan Xu, Hanqin Shao, Shengkai Xu, Xiaofei Zhang","submitted_at":"2015-05-08T07:20:34Z","abstract_excerpt":"In this paper, we study systematic Luby Transform (SLT) codes over additive white Gaussian noise (AWGN) channel. We introduce the encoding scheme of SLT codes and give the bipartite graph for iterative belief propagation (BP) decoding algorithm. Similar to low-density parity-check codes, Gaussian approximation (GA) is applied to yield asymptotic performance of SLT codes. Recent work about SLT codes has been focused on providing better encoding and decoding algorithms and design of degree distributions. In our work, we propose a novel linear programming method to optimize the degree distributio"},"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":"1505.01944","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-05-08T07:20:34Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"e88d43fb94360afc100383b1b6b050bfc201227ae42cc2def32ec9e6a771cc7c","abstract_canon_sha256":"3d29f199faffc43306dcb8e304ad6ce3691f56466dea1dd9365f7ce91a1ab83e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:16:38.415360Z","signature_b64":"rTLx3wVAeWQo+FyU3t4g7eDKocQSqvoFsytCB5mlnD3BXA6DGJwZSr/UFg2q/ekqYFDAKgWbo6eysuWz/bHODg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5f174aa915e56b02a583208c5cf552a4c82d2623539ebd9146ec1c7661d87727","last_reissued_at":"2026-05-18T02:16:38.414810Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:16:38.414810Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimization Design and Analysis of Systematic LT codes over AWGN Channel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Dazhuan Xu, Hanqin Shao, Shengkai Xu, Xiaofei Zhang","submitted_at":"2015-05-08T07:20:34Z","abstract_excerpt":"In this paper, we study systematic Luby Transform (SLT) codes over additive white Gaussian noise (AWGN) channel. We introduce the encoding scheme of SLT codes and give the bipartite graph for iterative belief propagation (BP) decoding algorithm. Similar to low-density parity-check codes, Gaussian approximation (GA) is applied to yield asymptotic performance of SLT codes. Recent work about SLT codes has been focused on providing better encoding and decoding algorithms and design of degree distributions. In our work, we propose a novel linear programming method to optimize the degree distributio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.01944","kind":"arxiv","version":1},"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":"1505.01944","created_at":"2026-05-18T02:16:38.414900+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.01944v1","created_at":"2026-05-18T02:16:38.414900+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.01944","created_at":"2026-05-18T02:16:38.414900+00:00"},{"alias_kind":"pith_short_12","alias_value":"L4LUVKIV4VVQ","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_16","alias_value":"L4LUVKIV4VVQFJMD","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_8","alias_value":"L4LUVKIV","created_at":"2026-05-18T12:29:29.992203+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/L4LUVKIV4VVQFJMDECGFZ5KSUT","json":"https://pith.science/pith/L4LUVKIV4VVQFJMDECGFZ5KSUT.json","graph_json":"https://pith.science/api/pith-number/L4LUVKIV4VVQFJMDECGFZ5KSUT/graph.json","events_json":"https://pith.science/api/pith-number/L4LUVKIV4VVQFJMDECGFZ5KSUT/events.json","paper":"https://pith.science/paper/L4LUVKIV"},"agent_actions":{"view_html":"https://pith.science/pith/L4LUVKIV4VVQFJMDECGFZ5KSUT","download_json":"https://pith.science/pith/L4LUVKIV4VVQFJMDECGFZ5KSUT.json","view_paper":"https://pith.science/paper/L4LUVKIV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.01944&json=true","fetch_graph":"https://pith.science/api/pith-number/L4LUVKIV4VVQFJMDECGFZ5KSUT/graph.json","fetch_events":"https://pith.science/api/pith-number/L4LUVKIV4VVQFJMDECGFZ5KSUT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L4LUVKIV4VVQFJMDECGFZ5KSUT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L4LUVKIV4VVQFJMDECGFZ5KSUT/action/storage_attestation","attest_author":"https://pith.science/pith/L4LUVKIV4VVQFJMDECGFZ5KSUT/action/author_attestation","sign_citation":"https://pith.science/pith/L4LUVKIV4VVQFJMDECGFZ5KSUT/action/citation_signature","submit_replication":"https://pith.science/pith/L4LUVKIV4VVQFJMDECGFZ5KSUT/action/replication_record"}},"created_at":"2026-05-18T02:16:38.414900+00:00","updated_at":"2026-05-18T02:16:38.414900+00:00"}