{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:VFO5DUMIOBSGW55J573TRHB3EH","short_pith_number":"pith:VFO5DUMI","schema_version":"1.0","canonical_sha256":"a95dd1d18870646b77a9eff7389c3b21f507832010960c75263fabfb62724049","source":{"kind":"arxiv","id":"1010.0060","version":2},"attestation_state":"computed","paper":{"title":"Design and Performance of Rate-compatible Non-Binary LDPC Convolutional Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hironori Uchikawa, Kenta Kasai, Kohichi Sakaniwa","submitted_at":"2010-10-01T04:27:29Z","abstract_excerpt":"In this paper, we present a construction method of non-binary low-density parity-check (LDPC) convolutional codes. Our construction method is an extension of Felstroem and Zigangirov construction for non-binary LDPC convolutional codes. The rate-compatibility of the non-binary convolutional code is also discussed. The proposed rate-compatible code is designed from one single mother (2,4)-regular non-binary LDPC convolutional code of rate 1/2. Higher-rate codes are produced by puncturing the mother code and lower-rate codes are produced by multiplicatively repeating the mother code. Simulation "},"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":"1010.0060","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-10-01T04:27:29Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"6775b5bc73778ff416c7561ea9867981e6b34296993351ae9d03cb6588cbd1d8","abstract_canon_sha256":"efec7b703bfce891dd938b67418ff341b445f7e7ddb63728d34b70d371b46bfb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:05:12.825390Z","signature_b64":"KIptm+yE1kkXO1hdotIIVvSXLX9mAHpU3I++vZKZjd4yFA6g5wo4Uy1ZR3AipmMEGGdHorvOQM3pMlwn3G3GDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a95dd1d18870646b77a9eff7389c3b21f507832010960c75263fabfb62724049","last_reissued_at":"2026-05-18T02:05:12.824663Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:05:12.824663Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Design and Performance of Rate-compatible Non-Binary LDPC Convolutional Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hironori Uchikawa, Kenta Kasai, Kohichi Sakaniwa","submitted_at":"2010-10-01T04:27:29Z","abstract_excerpt":"In this paper, we present a construction method of non-binary low-density parity-check (LDPC) convolutional codes. Our construction method is an extension of Felstroem and Zigangirov construction for non-binary LDPC convolutional codes. The rate-compatibility of the non-binary convolutional code is also discussed. The proposed rate-compatible code is designed from one single mother (2,4)-regular non-binary LDPC convolutional code of rate 1/2. Higher-rate codes are produced by puncturing the mother code and lower-rate codes are produced by multiplicatively repeating the mother code. Simulation "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.0060","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":"1010.0060","created_at":"2026-05-18T02:05:12.824764+00:00"},{"alias_kind":"arxiv_version","alias_value":"1010.0060v2","created_at":"2026-05-18T02:05:12.824764+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.0060","created_at":"2026-05-18T02:05:12.824764+00:00"},{"alias_kind":"pith_short_12","alias_value":"VFO5DUMIOBSG","created_at":"2026-05-18T12:26:15.391820+00:00"},{"alias_kind":"pith_short_16","alias_value":"VFO5DUMIOBSGW55J","created_at":"2026-05-18T12:26:15.391820+00:00"},{"alias_kind":"pith_short_8","alias_value":"VFO5DUMI","created_at":"2026-05-18T12:26:15.391820+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/VFO5DUMIOBSGW55J573TRHB3EH","json":"https://pith.science/pith/VFO5DUMIOBSGW55J573TRHB3EH.json","graph_json":"https://pith.science/api/pith-number/VFO5DUMIOBSGW55J573TRHB3EH/graph.json","events_json":"https://pith.science/api/pith-number/VFO5DUMIOBSGW55J573TRHB3EH/events.json","paper":"https://pith.science/paper/VFO5DUMI"},"agent_actions":{"view_html":"https://pith.science/pith/VFO5DUMIOBSGW55J573TRHB3EH","download_json":"https://pith.science/pith/VFO5DUMIOBSGW55J573TRHB3EH.json","view_paper":"https://pith.science/paper/VFO5DUMI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1010.0060&json=true","fetch_graph":"https://pith.science/api/pith-number/VFO5DUMIOBSGW55J573TRHB3EH/graph.json","fetch_events":"https://pith.science/api/pith-number/VFO5DUMIOBSGW55J573TRHB3EH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VFO5DUMIOBSGW55J573TRHB3EH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VFO5DUMIOBSGW55J573TRHB3EH/action/storage_attestation","attest_author":"https://pith.science/pith/VFO5DUMIOBSGW55J573TRHB3EH/action/author_attestation","sign_citation":"https://pith.science/pith/VFO5DUMIOBSGW55J573TRHB3EH/action/citation_signature","submit_replication":"https://pith.science/pith/VFO5DUMIOBSGW55J573TRHB3EH/action/replication_record"}},"created_at":"2026-05-18T02:05:12.824764+00:00","updated_at":"2026-05-18T02:05:12.824764+00:00"}