{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:LSIUPY6ZEER4GRESB65PLAFQKL","short_pith_number":"pith:LSIUPY6Z","schema_version":"1.0","canonical_sha256":"5c9147e3d92123c344920fbaf580b052f1c389a2631b8c5cfef9dc3dee9dfc50","source":{"kind":"arxiv","id":"1106.1414","version":1},"attestation_state":"computed","paper":{"title":"Exact Free Distance and Trapping Set Growth Rates for LDPC Convolutional Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ali E. Pusane, Daniel J. Costello Jr, David G. M. Mitchell, Michael Lentmaier","submitted_at":"2011-06-07T19:00:35Z","abstract_excerpt":"Ensembles of (J,K)-regular low-density parity-check convolutional (LDPCC) codes are known to be asymptotically good, in the sense that the minimum free distance grows linearly with the constraint length. In this paper, we use a protograph-based analysis of terminated LDPCC codes to obtain an upper bound on the free distance growth rate of ensembles of periodically time-varying LDPCC codes. This bound is compared to a lower bound and evaluated numerically. It is found that, for a sufficiently large period, the bounds coincide. This approach is then extended to obtain bounds on the trapping set "},"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":"1106.1414","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-06-07T19:00:35Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"63b69ab4395d247895d864c10c2314b8ef84d659290a4cb56fb5e17e8916a4d9","abstract_canon_sha256":"9ce6d8fc268636c11d32c62e9392ef48c1ae77f15df4e2a813d3d22fcf0941f9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:10.269960Z","signature_b64":"HPna76A15isJWoi2KwtrvumOt9QDB4zx9Eszn9jfGjxezJKQul5a/E+hNCalKSS329ypKvyfoypldD3cPjwoAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5c9147e3d92123c344920fbaf580b052f1c389a2631b8c5cfef9dc3dee9dfc50","last_reissued_at":"2026-05-18T00:59:10.269333Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:10.269333Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exact Free Distance and Trapping Set Growth Rates for LDPC Convolutional Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ali E. Pusane, Daniel J. Costello Jr, David G. M. Mitchell, Michael Lentmaier","submitted_at":"2011-06-07T19:00:35Z","abstract_excerpt":"Ensembles of (J,K)-regular low-density parity-check convolutional (LDPCC) codes are known to be asymptotically good, in the sense that the minimum free distance grows linearly with the constraint length. In this paper, we use a protograph-based analysis of terminated LDPCC codes to obtain an upper bound on the free distance growth rate of ensembles of periodically time-varying LDPCC codes. This bound is compared to a lower bound and evaluated numerically. It is found that, for a sufficiently large period, the bounds coincide. This approach is then extended to obtain bounds on the trapping set "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.1414","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":"1106.1414","created_at":"2026-05-18T00:59:10.269423+00:00"},{"alias_kind":"arxiv_version","alias_value":"1106.1414v1","created_at":"2026-05-18T00:59:10.269423+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.1414","created_at":"2026-05-18T00:59:10.269423+00:00"},{"alias_kind":"pith_short_12","alias_value":"LSIUPY6ZEER4","created_at":"2026-05-18T12:26:34.985390+00:00"},{"alias_kind":"pith_short_16","alias_value":"LSIUPY6ZEER4GRES","created_at":"2026-05-18T12:26:34.985390+00:00"},{"alias_kind":"pith_short_8","alias_value":"LSIUPY6Z","created_at":"2026-05-18T12:26:34.985390+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/LSIUPY6ZEER4GRESB65PLAFQKL","json":"https://pith.science/pith/LSIUPY6ZEER4GRESB65PLAFQKL.json","graph_json":"https://pith.science/api/pith-number/LSIUPY6ZEER4GRESB65PLAFQKL/graph.json","events_json":"https://pith.science/api/pith-number/LSIUPY6ZEER4GRESB65PLAFQKL/events.json","paper":"https://pith.science/paper/LSIUPY6Z"},"agent_actions":{"view_html":"https://pith.science/pith/LSIUPY6ZEER4GRESB65PLAFQKL","download_json":"https://pith.science/pith/LSIUPY6ZEER4GRESB65PLAFQKL.json","view_paper":"https://pith.science/paper/LSIUPY6Z","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1106.1414&json=true","fetch_graph":"https://pith.science/api/pith-number/LSIUPY6ZEER4GRESB65PLAFQKL/graph.json","fetch_events":"https://pith.science/api/pith-number/LSIUPY6ZEER4GRESB65PLAFQKL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LSIUPY6ZEER4GRESB65PLAFQKL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LSIUPY6ZEER4GRESB65PLAFQKL/action/storage_attestation","attest_author":"https://pith.science/pith/LSIUPY6ZEER4GRESB65PLAFQKL/action/author_attestation","sign_citation":"https://pith.science/pith/LSIUPY6ZEER4GRESB65PLAFQKL/action/citation_signature","submit_replication":"https://pith.science/pith/LSIUPY6ZEER4GRESB65PLAFQKL/action/replication_record"}},"created_at":"2026-05-18T00:59:10.269423+00:00","updated_at":"2026-05-18T00:59:10.269423+00:00"}