{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:RWKSGH5JCDVM5OFWC66D6X5XGF","short_pith_number":"pith:RWKSGH5J","schema_version":"1.0","canonical_sha256":"8d95231fa910eaceb8b617bc3f5fb73155522ae445cb7d75ab8d446517bfe275","source":{"kind":"arxiv","id":"1802.07598","version":2},"attestation_state":"computed","paper":{"title":"Design of Irregular SC-LDPC Codes With Non-Uniform Degree Distributions by Linear Programing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Heeyoul Kwak, Hosung Park, Jong-Seon No","submitted_at":"2018-02-21T14:56:03Z","abstract_excerpt":"In this paper, we propose a new design method of irregular spatially-coupled low-density parity-check (SC-LDPC) codes with non-uniform degree distributions by linear programming (LP). In general, irregular SC-LDPC codes with non-uniform degree distributions is difficult to design with low complexity because their density evolution equations are multi-dimensional. To solve the problem, the proposed method is based on two main ideas: A local design of the degree distributions and pre-computation of the input/output message relationship. These ideas make it possible to design the degree distribut"},"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":"1802.07598","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-02-21T14:56:03Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"56262a2ebb715fd09a30529fca96436c064e2b4ccd9fff66f834623e23592457","abstract_canon_sha256":"1343a68530e56f3526a47e5ed6d9a2aada5c65b659686d5ebecaf677e699eb1e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:20:02.028716Z","signature_b64":"7HvOBJ/BCTAciiYpQaXwg74llqtiElOR8S1JZMkLk9GddSkm7eVzvjh5tq3D/PrUH3wfnWs9pEr7WBpICn3xDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8d95231fa910eaceb8b617bc3f5fb73155522ae445cb7d75ab8d446517bfe275","last_reissued_at":"2026-05-18T00:20:02.028197Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:20:02.028197Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Design of Irregular SC-LDPC Codes With Non-Uniform Degree Distributions by Linear Programing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Heeyoul Kwak, Hosung Park, Jong-Seon No","submitted_at":"2018-02-21T14:56:03Z","abstract_excerpt":"In this paper, we propose a new design method of irregular spatially-coupled low-density parity-check (SC-LDPC) codes with non-uniform degree distributions by linear programming (LP). In general, irregular SC-LDPC codes with non-uniform degree distributions is difficult to design with low complexity because their density evolution equations are multi-dimensional. To solve the problem, the proposed method is based on two main ideas: A local design of the degree distributions and pre-computation of the input/output message relationship. These ideas make it possible to design the degree distribut"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.07598","kind":"arxiv","version":2},"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":"1802.07598","created_at":"2026-05-18T00:20:02.028273+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.07598v2","created_at":"2026-05-18T00:20:02.028273+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.07598","created_at":"2026-05-18T00:20:02.028273+00:00"},{"alias_kind":"pith_short_12","alias_value":"RWKSGH5JCDVM","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_16","alias_value":"RWKSGH5JCDVM5OFW","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_8","alias_value":"RWKSGH5J","created_at":"2026-05-18T12:32:50.500415+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/RWKSGH5JCDVM5OFWC66D6X5XGF","json":"https://pith.science/pith/RWKSGH5JCDVM5OFWC66D6X5XGF.json","graph_json":"https://pith.science/api/pith-number/RWKSGH5JCDVM5OFWC66D6X5XGF/graph.json","events_json":"https://pith.science/api/pith-number/RWKSGH5JCDVM5OFWC66D6X5XGF/events.json","paper":"https://pith.science/paper/RWKSGH5J"},"agent_actions":{"view_html":"https://pith.science/pith/RWKSGH5JCDVM5OFWC66D6X5XGF","download_json":"https://pith.science/pith/RWKSGH5JCDVM5OFWC66D6X5XGF.json","view_paper":"https://pith.science/paper/RWKSGH5J","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.07598&json=true","fetch_graph":"https://pith.science/api/pith-number/RWKSGH5JCDVM5OFWC66D6X5XGF/graph.json","fetch_events":"https://pith.science/api/pith-number/RWKSGH5JCDVM5OFWC66D6X5XGF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RWKSGH5JCDVM5OFWC66D6X5XGF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RWKSGH5JCDVM5OFWC66D6X5XGF/action/storage_attestation","attest_author":"https://pith.science/pith/RWKSGH5JCDVM5OFWC66D6X5XGF/action/author_attestation","sign_citation":"https://pith.science/pith/RWKSGH5JCDVM5OFWC66D6X5XGF/action/citation_signature","submit_replication":"https://pith.science/pith/RWKSGH5JCDVM5OFWC66D6X5XGF/action/replication_record"}},"created_at":"2026-05-18T00:20:02.028273+00:00","updated_at":"2026-05-18T00:20:02.028273+00:00"}