{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2007:AZUQ6KIWYYMW5CKBVEZWYHZTBH","short_pith_number":"pith:AZUQ6KIW","schema_version":"1.0","canonical_sha256":"06690f2916c6196e8941a9336c1f3309f2b5147c4d1fbc457c5b1187418ec25f","source":{"kind":"arxiv","id":"0708.0905","version":3},"attestation_state":"computed","paper":{"title":"Permutation Decoding and the Stopping Redundancy Hierarchy of Cyclic and Extended Cyclic Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Johannes B. Huber, Olgica Milenkovic, Stefan Laendner, Thorsten Hehn","submitted_at":"2007-08-07T09:55:31Z","abstract_excerpt":"We introduce the notion of the stopping redundancy hierarchy of a linear block code as a measure of the trade-off between performance and complexity of iterative decoding for the binary erasure channel. We derive lower and upper bounds for the stopping redundancy hierarchy via Lovasz's Local Lemma and Bonferroni-type inequalities, and specialize them for codes with cyclic parity-check matrices. Based on the observed properties of parity-check matrices with good stopping redundancy characteristics, we develop a novel decoding technique, termed automorphism group decoding, that combines iterativ"},"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":"0708.0905","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2007-08-07T09:55:31Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"1ee153323d57175c64c84e691c15d4a71dbd852178c044d6f2e18e8e96c46ce5","abstract_canon_sha256":"c9311b57411203e5517fc94b4d0f33533271bcdb6da57850ba13bf1a671bd990"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:12.047346Z","signature_b64":"NmA0D8zuPwST2tGyv4fi3ala5eZO5zvfzKZ3ANF/qxvUp+O7seSFG/1Fe61qMC9TDwWmLMP8sg1pmJGNKvytCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"06690f2916c6196e8941a9336c1f3309f2b5147c4d1fbc457c5b1187418ec25f","last_reissued_at":"2026-05-18T00:59:12.046701Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:12.046701Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Permutation Decoding and the Stopping Redundancy Hierarchy of Cyclic and Extended Cyclic Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Johannes B. Huber, Olgica Milenkovic, Stefan Laendner, Thorsten Hehn","submitted_at":"2007-08-07T09:55:31Z","abstract_excerpt":"We introduce the notion of the stopping redundancy hierarchy of a linear block code as a measure of the trade-off between performance and complexity of iterative decoding for the binary erasure channel. We derive lower and upper bounds for the stopping redundancy hierarchy via Lovasz's Local Lemma and Bonferroni-type inequalities, and specialize them for codes with cyclic parity-check matrices. Based on the observed properties of parity-check matrices with good stopping redundancy characteristics, we develop a novel decoding technique, termed automorphism group decoding, that combines iterativ"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0708.0905","kind":"arxiv","version":3},"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":"0708.0905","created_at":"2026-05-18T00:59:12.046788+00:00"},{"alias_kind":"arxiv_version","alias_value":"0708.0905v3","created_at":"2026-05-18T00:59:12.046788+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0708.0905","created_at":"2026-05-18T00:59:12.046788+00:00"},{"alias_kind":"pith_short_12","alias_value":"AZUQ6KIWYYMW","created_at":"2026-05-18T12:25:55.427421+00:00"},{"alias_kind":"pith_short_16","alias_value":"AZUQ6KIWYYMW5CKB","created_at":"2026-05-18T12:25:55.427421+00:00"},{"alias_kind":"pith_short_8","alias_value":"AZUQ6KIW","created_at":"2026-05-18T12:25:55.427421+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/AZUQ6KIWYYMW5CKBVEZWYHZTBH","json":"https://pith.science/pith/AZUQ6KIWYYMW5CKBVEZWYHZTBH.json","graph_json":"https://pith.science/api/pith-number/AZUQ6KIWYYMW5CKBVEZWYHZTBH/graph.json","events_json":"https://pith.science/api/pith-number/AZUQ6KIWYYMW5CKBVEZWYHZTBH/events.json","paper":"https://pith.science/paper/AZUQ6KIW"},"agent_actions":{"view_html":"https://pith.science/pith/AZUQ6KIWYYMW5CKBVEZWYHZTBH","download_json":"https://pith.science/pith/AZUQ6KIWYYMW5CKBVEZWYHZTBH.json","view_paper":"https://pith.science/paper/AZUQ6KIW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0708.0905&json=true","fetch_graph":"https://pith.science/api/pith-number/AZUQ6KIWYYMW5CKBVEZWYHZTBH/graph.json","fetch_events":"https://pith.science/api/pith-number/AZUQ6KIWYYMW5CKBVEZWYHZTBH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AZUQ6KIWYYMW5CKBVEZWYHZTBH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AZUQ6KIWYYMW5CKBVEZWYHZTBH/action/storage_attestation","attest_author":"https://pith.science/pith/AZUQ6KIWYYMW5CKBVEZWYHZTBH/action/author_attestation","sign_citation":"https://pith.science/pith/AZUQ6KIWYYMW5CKBVEZWYHZTBH/action/citation_signature","submit_replication":"https://pith.science/pith/AZUQ6KIWYYMW5CKBVEZWYHZTBH/action/replication_record"}},"created_at":"2026-05-18T00:59:12.046788+00:00","updated_at":"2026-05-18T00:59:12.046788+00:00"}