{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:HTTXEHSZTLALO5WSOMNDPJ2IE7","short_pith_number":"pith:HTTXEHSZ","schema_version":"1.0","canonical_sha256":"3ce7721e599ac0b776d2731a37a74827c62c948b0862bc63fec235be4546b212","source":{"kind":"arxiv","id":"1610.00873","version":1},"attestation_state":"computed","paper":{"title":"Code Design for Short Blocks: A Survey","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Gianluigi Liva, Lorenzo Gaudio, Thomas Jerkovits, Tudor Ninacs","submitted_at":"2016-10-04T07:15:10Z","abstract_excerpt":"The design of block codes for short information blocks (e.g., a thousand or less information bits) is an open research problem which is gaining relevance thanks to emerging applications in wireless communication networks. In this work, we review some of the most recent code constructions targeting the short block regime, and we compare then with both finite-length performance bounds and classical error correction coding schemes. We will see how it is possible to effectively approach the theoretical bounds, with different performance vs. decoding complexity trade-offs."},"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":"1610.00873","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-10-04T07:15:10Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"24b9193dd9936d33cf0e68afc7fd1fcc4b9c548ac3cbfd0a42a6faa03d7ca02f","abstract_canon_sha256":"bbc488a5565259d924362a05700b95a32b2f82232926383d659ec75c21487d37"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:03:13.038270Z","signature_b64":"OhHeRX3fJFKgznu04AiXbR22nlo68vJpmrdM2iYq2FRCdt0jU5vYNjNKxqQSvTEZ29hJAJNP04JAgs9xQqtACQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3ce7721e599ac0b776d2731a37a74827c62c948b0862bc63fec235be4546b212","last_reissued_at":"2026-05-18T01:03:13.037835Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:03:13.037835Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Code Design for Short Blocks: A Survey","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Gianluigi Liva, Lorenzo Gaudio, Thomas Jerkovits, Tudor Ninacs","submitted_at":"2016-10-04T07:15:10Z","abstract_excerpt":"The design of block codes for short information blocks (e.g., a thousand or less information bits) is an open research problem which is gaining relevance thanks to emerging applications in wireless communication networks. In this work, we review some of the most recent code constructions targeting the short block regime, and we compare then with both finite-length performance bounds and classical error correction coding schemes. We will see how it is possible to effectively approach the theoretical bounds, with different performance vs. decoding complexity trade-offs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.00873","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":"1610.00873","created_at":"2026-05-18T01:03:13.037896+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.00873v1","created_at":"2026-05-18T01:03:13.037896+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.00873","created_at":"2026-05-18T01:03:13.037896+00:00"},{"alias_kind":"pith_short_12","alias_value":"HTTXEHSZTLAL","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_16","alias_value":"HTTXEHSZTLALO5WS","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_8","alias_value":"HTTXEHSZ","created_at":"2026-05-18T12:30:22.444734+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.08468","citing_title":"Shaped On-Off Keying Using Polar Codes","ref_index":23,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HTTXEHSZTLALO5WSOMNDPJ2IE7","json":"https://pith.science/pith/HTTXEHSZTLALO5WSOMNDPJ2IE7.json","graph_json":"https://pith.science/api/pith-number/HTTXEHSZTLALO5WSOMNDPJ2IE7/graph.json","events_json":"https://pith.science/api/pith-number/HTTXEHSZTLALO5WSOMNDPJ2IE7/events.json","paper":"https://pith.science/paper/HTTXEHSZ"},"agent_actions":{"view_html":"https://pith.science/pith/HTTXEHSZTLALO5WSOMNDPJ2IE7","download_json":"https://pith.science/pith/HTTXEHSZTLALO5WSOMNDPJ2IE7.json","view_paper":"https://pith.science/paper/HTTXEHSZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.00873&json=true","fetch_graph":"https://pith.science/api/pith-number/HTTXEHSZTLALO5WSOMNDPJ2IE7/graph.json","fetch_events":"https://pith.science/api/pith-number/HTTXEHSZTLALO5WSOMNDPJ2IE7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HTTXEHSZTLALO5WSOMNDPJ2IE7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HTTXEHSZTLALO5WSOMNDPJ2IE7/action/storage_attestation","attest_author":"https://pith.science/pith/HTTXEHSZTLALO5WSOMNDPJ2IE7/action/author_attestation","sign_citation":"https://pith.science/pith/HTTXEHSZTLALO5WSOMNDPJ2IE7/action/citation_signature","submit_replication":"https://pith.science/pith/HTTXEHSZTLALO5WSOMNDPJ2IE7/action/replication_record"}},"created_at":"2026-05-18T01:03:13.037896+00:00","updated_at":"2026-05-18T01:03:13.037896+00:00"}