{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:NNQUXGRAFRYNJNUGWC3VTCWQTH","short_pith_number":"pith:NNQUXGRA","schema_version":"1.0","canonical_sha256":"6b614b9a202c70d4b686b0b7598ad099c4293eba176eba5a2549574d82056163","source":{"kind":"arxiv","id":"1803.08141","version":1},"attestation_state":"computed","paper":{"title":"Efficient Search of QC-LDPC Codes with Girths 6 and 8 and Free of Elementary Trapping Sets with Small Size","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Farzane Amirzade, Mohammad-Reza Sadeghi","submitted_at":"2018-03-21T21:08:26Z","abstract_excerpt":"One of the phenomena that influences significantly the performance of low-density parity-check codes is known as trapping sets. An $(a,b)$ elementary trapping set, or simply an ETS where $a$ is the size and $b$ is the number of degree-one check nodes and $\\frac{b}{a}<1$, causes high decoding failure rate and exert a strong influence on the error floor. In this paper, we provide sufficient conditions for exponent matrices to have fully connected $(3,n)$-regular QC-LDPC codes with girths 6 and 8 whose Tanner graphs are free of small ETSs. Applying sufficient conditions on the exponent matrix to "},"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":"1803.08141","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-03-21T21:08:26Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d6ecd58d918261486b7a5c869acad60b1dd3711ebd9329ffe4708a5df107883c","abstract_canon_sha256":"700dc2ffc2c88bde533a2de6b5a45d673c7b37e23543fe28cbac1be56585c642"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:20:23.578957Z","signature_b64":"RDehajcr03bFgp031i/+JfSoVs9VNAeAJTcwmcko2y+lN4yvdizVIeY1zA46XxL2X3YxTxXpLW9GUfspQCkcDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6b614b9a202c70d4b686b0b7598ad099c4293eba176eba5a2549574d82056163","last_reissued_at":"2026-05-18T00:20:23.578460Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:20:23.578460Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Search of QC-LDPC Codes with Girths 6 and 8 and Free of Elementary Trapping Sets with Small Size","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Farzane Amirzade, Mohammad-Reza Sadeghi","submitted_at":"2018-03-21T21:08:26Z","abstract_excerpt":"One of the phenomena that influences significantly the performance of low-density parity-check codes is known as trapping sets. An $(a,b)$ elementary trapping set, or simply an ETS where $a$ is the size and $b$ is the number of degree-one check nodes and $\\frac{b}{a}<1$, causes high decoding failure rate and exert a strong influence on the error floor. In this paper, we provide sufficient conditions for exponent matrices to have fully connected $(3,n)$-regular QC-LDPC codes with girths 6 and 8 whose Tanner graphs are free of small ETSs. Applying sufficient conditions on the exponent matrix to "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.08141","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":"1803.08141","created_at":"2026-05-18T00:20:23.578547+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.08141v1","created_at":"2026-05-18T00:20:23.578547+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.08141","created_at":"2026-05-18T00:20:23.578547+00:00"},{"alias_kind":"pith_short_12","alias_value":"NNQUXGRAFRYN","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_16","alias_value":"NNQUXGRAFRYNJNUG","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_8","alias_value":"NNQUXGRA","created_at":"2026-05-18T12:32:40.477152+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/NNQUXGRAFRYNJNUGWC3VTCWQTH","json":"https://pith.science/pith/NNQUXGRAFRYNJNUGWC3VTCWQTH.json","graph_json":"https://pith.science/api/pith-number/NNQUXGRAFRYNJNUGWC3VTCWQTH/graph.json","events_json":"https://pith.science/api/pith-number/NNQUXGRAFRYNJNUGWC3VTCWQTH/events.json","paper":"https://pith.science/paper/NNQUXGRA"},"agent_actions":{"view_html":"https://pith.science/pith/NNQUXGRAFRYNJNUGWC3VTCWQTH","download_json":"https://pith.science/pith/NNQUXGRAFRYNJNUGWC3VTCWQTH.json","view_paper":"https://pith.science/paper/NNQUXGRA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.08141&json=true","fetch_graph":"https://pith.science/api/pith-number/NNQUXGRAFRYNJNUGWC3VTCWQTH/graph.json","fetch_events":"https://pith.science/api/pith-number/NNQUXGRAFRYNJNUGWC3VTCWQTH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NNQUXGRAFRYNJNUGWC3VTCWQTH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NNQUXGRAFRYNJNUGWC3VTCWQTH/action/storage_attestation","attest_author":"https://pith.science/pith/NNQUXGRAFRYNJNUGWC3VTCWQTH/action/author_attestation","sign_citation":"https://pith.science/pith/NNQUXGRAFRYNJNUGWC3VTCWQTH/action/citation_signature","submit_replication":"https://pith.science/pith/NNQUXGRAFRYNJNUGWC3VTCWQTH/action/replication_record"}},"created_at":"2026-05-18T00:20:23.578547+00:00","updated_at":"2026-05-18T00:20:23.578547+00:00"}