{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2007:XSUQ4SSZWT6UYEVM22UYYBCZZ4","short_pith_number":"pith:XSUQ4SSZ","schema_version":"1.0","canonical_sha256":"bca90e4a59b4fd4c12acd6a98c0459cf3cd55c8be726ed119cbe6f0085ddf04b","source":{"kind":"arxiv","id":"0710.1182","version":1},"attestation_state":"computed","paper":{"title":"Low-Density Parity-Check Codes for Nonergodic Block-Fading Channels","license":"","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Albert Guillen i Fabregas, Ezio Biglieri, Gilles Zemor, Joseph J. Boutros","submitted_at":"2007-10-05T10:47:52Z","abstract_excerpt":"We solve the problem of designing powerful low-density parity-check (LDPC) codes with iterative decoding for the block-fading channel. We first study the case of maximum-likelihood decoding, and show that the design criterion is rather straightforward. Unfortunately, optimal constructions for maximum-likelihood decoding do not perform well under iterative decoding. To overcome this limitation, we then introduce a new family of full-diversity LDPC codes that exhibit near-outage-limit performance under iterative decoding for all block-lengths. This family competes with multiplexed parallel turbo"},"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":"0710.1182","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.IT","submitted_at":"2007-10-05T10:47:52Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"453b1713a58f054822f8c26bf5b3c45cefb9849eade7ee2c5beb17f8ac40a504","abstract_canon_sha256":"616746aaa76c8c68bb365c2134f4d7ba1fe06fe12f080b052a3740ef1b0c3fe6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:58.841680Z","signature_b64":"6Hx96rJKP6axgZc5+Shax3twNyI1Cox7C98zW5EDdWqh9MeFfYngGZzn6pD567JPBlFqrb6rmDfVOMzP27BiCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bca90e4a59b4fd4c12acd6a98c0459cf3cd55c8be726ed119cbe6f0085ddf04b","last_reissued_at":"2026-05-18T00:57:58.841259Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:58.841259Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Low-Density Parity-Check Codes for Nonergodic Block-Fading Channels","license":"","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Albert Guillen i Fabregas, Ezio Biglieri, Gilles Zemor, Joseph J. Boutros","submitted_at":"2007-10-05T10:47:52Z","abstract_excerpt":"We solve the problem of designing powerful low-density parity-check (LDPC) codes with iterative decoding for the block-fading channel. We first study the case of maximum-likelihood decoding, and show that the design criterion is rather straightforward. Unfortunately, optimal constructions for maximum-likelihood decoding do not perform well under iterative decoding. To overcome this limitation, we then introduce a new family of full-diversity LDPC codes that exhibit near-outage-limit performance under iterative decoding for all block-lengths. This family competes with multiplexed parallel turbo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0710.1182","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":"0710.1182","created_at":"2026-05-18T00:57:58.841324+00:00"},{"alias_kind":"arxiv_version","alias_value":"0710.1182v1","created_at":"2026-05-18T00:57:58.841324+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0710.1182","created_at":"2026-05-18T00:57:58.841324+00:00"},{"alias_kind":"pith_short_12","alias_value":"XSUQ4SSZWT6U","created_at":"2026-05-18T12:25:56.245647+00:00"},{"alias_kind":"pith_short_16","alias_value":"XSUQ4SSZWT6UYEVM","created_at":"2026-05-18T12:25:56.245647+00:00"},{"alias_kind":"pith_short_8","alias_value":"XSUQ4SSZ","created_at":"2026-05-18T12:25:56.245647+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/XSUQ4SSZWT6UYEVM22UYYBCZZ4","json":"https://pith.science/pith/XSUQ4SSZWT6UYEVM22UYYBCZZ4.json","graph_json":"https://pith.science/api/pith-number/XSUQ4SSZWT6UYEVM22UYYBCZZ4/graph.json","events_json":"https://pith.science/api/pith-number/XSUQ4SSZWT6UYEVM22UYYBCZZ4/events.json","paper":"https://pith.science/paper/XSUQ4SSZ"},"agent_actions":{"view_html":"https://pith.science/pith/XSUQ4SSZWT6UYEVM22UYYBCZZ4","download_json":"https://pith.science/pith/XSUQ4SSZWT6UYEVM22UYYBCZZ4.json","view_paper":"https://pith.science/paper/XSUQ4SSZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0710.1182&json=true","fetch_graph":"https://pith.science/api/pith-number/XSUQ4SSZWT6UYEVM22UYYBCZZ4/graph.json","fetch_events":"https://pith.science/api/pith-number/XSUQ4SSZWT6UYEVM22UYYBCZZ4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XSUQ4SSZWT6UYEVM22UYYBCZZ4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XSUQ4SSZWT6UYEVM22UYYBCZZ4/action/storage_attestation","attest_author":"https://pith.science/pith/XSUQ4SSZWT6UYEVM22UYYBCZZ4/action/author_attestation","sign_citation":"https://pith.science/pith/XSUQ4SSZWT6UYEVM22UYYBCZZ4/action/citation_signature","submit_replication":"https://pith.science/pith/XSUQ4SSZWT6UYEVM22UYYBCZZ4/action/replication_record"}},"created_at":"2026-05-18T00:57:58.841324+00:00","updated_at":"2026-05-18T00:57:58.841324+00:00"}