{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:3B2W5ACIDWQRUUXNCBMA3IPGML","short_pith_number":"pith:3B2W5ACI","schema_version":"1.0","canonical_sha256":"d8756e80481da11a52ed10580da1e662c48d51f960ebcadf4654d07dc65af36e","source":{"kind":"arxiv","id":"1306.4009","version":1},"attestation_state":"computed","paper":{"title":"On the Asymptotic Performance of Bit-Wise Decoders for Coded Modulation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alex Alvarado, Erik Agrell, Fredrik Brannstrom, Mikhail Ivanov","submitted_at":"2013-06-17T20:29:05Z","abstract_excerpt":"Two decoder structures for coded modulation over the Gaussian and flat fading channels are studied: the maximum likelihood symbol-wise decoder, and the (suboptimal) bit-wise decoder based on the bit-interleaved coded modulation paradigm. We consider a 16-ary quadrature amplitude constellation labeled by a Gray labeling. It is shown that the asymptotic loss in terms of pairwise error probability, for any two codewords caused by the bit-wise decoder, is bounded by 1.25 dB. The analysis also shows that for the Gaussian channel the asymptotic loss is zero for a wide range of linear codes, includin"},"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":"1306.4009","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-06-17T20:29:05Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"5793f17f991f846a3f0e7c3689627ee145b859f835c2bb5fa2324aa1516ba1d3","abstract_canon_sha256":"28988d7f640cc025e77345a493d4154f5fd2c99b86a52f362861a851f8a4e683"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:53:41.370637Z","signature_b64":"mZZfATWT9JfHKNVpb4smF8x11RnH8jbwRdl7fLRtcK7/8KQ3rnRWXy3lIs0qzQPkN81uCkLrewX1xm/Ec0rfBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d8756e80481da11a52ed10580da1e662c48d51f960ebcadf4654d07dc65af36e","last_reissued_at":"2026-05-18T02:53:41.370057Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:53:41.370057Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Asymptotic Performance of Bit-Wise Decoders for Coded Modulation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alex Alvarado, Erik Agrell, Fredrik Brannstrom, Mikhail Ivanov","submitted_at":"2013-06-17T20:29:05Z","abstract_excerpt":"Two decoder structures for coded modulation over the Gaussian and flat fading channels are studied: the maximum likelihood symbol-wise decoder, and the (suboptimal) bit-wise decoder based on the bit-interleaved coded modulation paradigm. We consider a 16-ary quadrature amplitude constellation labeled by a Gray labeling. It is shown that the asymptotic loss in terms of pairwise error probability, for any two codewords caused by the bit-wise decoder, is bounded by 1.25 dB. The analysis also shows that for the Gaussian channel the asymptotic loss is zero for a wide range of linear codes, includin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.4009","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":"1306.4009","created_at":"2026-05-18T02:53:41.370144+00:00"},{"alias_kind":"arxiv_version","alias_value":"1306.4009v1","created_at":"2026-05-18T02:53:41.370144+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.4009","created_at":"2026-05-18T02:53:41.370144+00:00"},{"alias_kind":"pith_short_12","alias_value":"3B2W5ACIDWQR","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_16","alias_value":"3B2W5ACIDWQRUUXN","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_8","alias_value":"3B2W5ACI","created_at":"2026-05-18T12:27:32.513160+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/3B2W5ACIDWQRUUXNCBMA3IPGML","json":"https://pith.science/pith/3B2W5ACIDWQRUUXNCBMA3IPGML.json","graph_json":"https://pith.science/api/pith-number/3B2W5ACIDWQRUUXNCBMA3IPGML/graph.json","events_json":"https://pith.science/api/pith-number/3B2W5ACIDWQRUUXNCBMA3IPGML/events.json","paper":"https://pith.science/paper/3B2W5ACI"},"agent_actions":{"view_html":"https://pith.science/pith/3B2W5ACIDWQRUUXNCBMA3IPGML","download_json":"https://pith.science/pith/3B2W5ACIDWQRUUXNCBMA3IPGML.json","view_paper":"https://pith.science/paper/3B2W5ACI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1306.4009&json=true","fetch_graph":"https://pith.science/api/pith-number/3B2W5ACIDWQRUUXNCBMA3IPGML/graph.json","fetch_events":"https://pith.science/api/pith-number/3B2W5ACIDWQRUUXNCBMA3IPGML/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3B2W5ACIDWQRUUXNCBMA3IPGML/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3B2W5ACIDWQRUUXNCBMA3IPGML/action/storage_attestation","attest_author":"https://pith.science/pith/3B2W5ACIDWQRUUXNCBMA3IPGML/action/author_attestation","sign_citation":"https://pith.science/pith/3B2W5ACIDWQRUUXNCBMA3IPGML/action/citation_signature","submit_replication":"https://pith.science/pith/3B2W5ACIDWQRUUXNCBMA3IPGML/action/replication_record"}},"created_at":"2026-05-18T02:53:41.370144+00:00","updated_at":"2026-05-18T02:53:41.370144+00:00"}