{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:AUFGDVRFNFH3HLCKEWILEIODIG","short_pith_number":"pith:AUFGDVRF","schema_version":"1.0","canonical_sha256":"050a61d625694fb3ac4a2590b221c341aa1a67a1f2122274afc1ca1846febe23","source":{"kind":"arxiv","id":"1108.2861","version":4},"attestation_state":"computed","paper":{"title":"Generalized Distributive Law for ML Decoding of Space-Time Block Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"B. Sundar Rajan, Lakshmi Prasad Natarajan","submitted_at":"2011-08-14T10:52:17Z","abstract_excerpt":"The problem of designing good Space-Time Block Codes (STBCs) with low maximum-likelihood (ML) decoding complexity has gathered much attention in the literature. All the known low ML decoding complexity techniques utilize the same approach of exploiting either the multigroup decodable or the fast-decodable (conditionally multigroup decodable) structure of a code. We refer to this well known technique of decoding STBCs as Conditional ML (CML) decoding. In this paper we introduce a new framework to construct ML decoders for STBCs based on the Generalized Distributive Law (GDL) and the Factor-grap"},"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":"1108.2861","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-08-14T10:52:17Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"34beb9ebfd17669c05dbf67de10c5454d459b56bf8245e6ad8aec75a985226c0","abstract_canon_sha256":"816f3763e62ac71c0ffd2ad1d1eaf7ea4aecfae09a5a2d4f86796636ae9b60d0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:41.821020Z","signature_b64":"HHvq8FJqoSzZNLspd7PoS/c4KA015YGGE3lRkZujSokLFZrm3u4bt1Cnswix68+Feu2YX/vwFj6jBcvEtMtvAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"050a61d625694fb3ac4a2590b221c341aa1a67a1f2122274afc1ca1846febe23","last_reissued_at":"2026-05-18T02:21:41.820374Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:41.820374Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Generalized Distributive Law for ML Decoding of Space-Time Block Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"B. Sundar Rajan, Lakshmi Prasad Natarajan","submitted_at":"2011-08-14T10:52:17Z","abstract_excerpt":"The problem of designing good Space-Time Block Codes (STBCs) with low maximum-likelihood (ML) decoding complexity has gathered much attention in the literature. All the known low ML decoding complexity techniques utilize the same approach of exploiting either the multigroup decodable or the fast-decodable (conditionally multigroup decodable) structure of a code. We refer to this well known technique of decoding STBCs as Conditional ML (CML) decoding. In this paper we introduce a new framework to construct ML decoders for STBCs based on the Generalized Distributive Law (GDL) and the Factor-grap"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.2861","kind":"arxiv","version":4},"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":"1108.2861","created_at":"2026-05-18T02:21:41.820471+00:00"},{"alias_kind":"arxiv_version","alias_value":"1108.2861v4","created_at":"2026-05-18T02:21:41.820471+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.2861","created_at":"2026-05-18T02:21:41.820471+00:00"},{"alias_kind":"pith_short_12","alias_value":"AUFGDVRFNFH3","created_at":"2026-05-18T12:26:24.575870+00:00"},{"alias_kind":"pith_short_16","alias_value":"AUFGDVRFNFH3HLCK","created_at":"2026-05-18T12:26:24.575870+00:00"},{"alias_kind":"pith_short_8","alias_value":"AUFGDVRF","created_at":"2026-05-18T12:26:24.575870+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/AUFGDVRFNFH3HLCKEWILEIODIG","json":"https://pith.science/pith/AUFGDVRFNFH3HLCKEWILEIODIG.json","graph_json":"https://pith.science/api/pith-number/AUFGDVRFNFH3HLCKEWILEIODIG/graph.json","events_json":"https://pith.science/api/pith-number/AUFGDVRFNFH3HLCKEWILEIODIG/events.json","paper":"https://pith.science/paper/AUFGDVRF"},"agent_actions":{"view_html":"https://pith.science/pith/AUFGDVRFNFH3HLCKEWILEIODIG","download_json":"https://pith.science/pith/AUFGDVRFNFH3HLCKEWILEIODIG.json","view_paper":"https://pith.science/paper/AUFGDVRF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1108.2861&json=true","fetch_graph":"https://pith.science/api/pith-number/AUFGDVRFNFH3HLCKEWILEIODIG/graph.json","fetch_events":"https://pith.science/api/pith-number/AUFGDVRFNFH3HLCKEWILEIODIG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AUFGDVRFNFH3HLCKEWILEIODIG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AUFGDVRFNFH3HLCKEWILEIODIG/action/storage_attestation","attest_author":"https://pith.science/pith/AUFGDVRFNFH3HLCKEWILEIODIG/action/author_attestation","sign_citation":"https://pith.science/pith/AUFGDVRFNFH3HLCKEWILEIODIG/action/citation_signature","submit_replication":"https://pith.science/pith/AUFGDVRFNFH3HLCKEWILEIODIG/action/replication_record"}},"created_at":"2026-05-18T02:21:41.820471+00:00","updated_at":"2026-05-18T02:21:41.820471+00:00"}