{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:6AEIARUH3LPBU44RKPRFSHS2A7","short_pith_number":"pith:6AEIARUH","schema_version":"1.0","canonical_sha256":"f008804687dade1a739153e2591e5a07d18189a163192a2ee878d50f36d0263b","source":{"kind":"arxiv","id":"1710.01475","version":1},"attestation_state":"computed","paper":{"title":"On the Design of Multi-Dimensional Irregular Repeat-Accumulate Lattice Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jinhong Yuan, Lei Yang, Min Qiu, Yixuan Xie","submitted_at":"2017-10-04T06:30:10Z","abstract_excerpt":"Most multi-dimensional (more than two dimensions) lattice partitions only form additive quotient groups and lack multiplication operations. This prevents us from constructing lattice codes based on multi-dimensional lattice partitions directly from non-binary linear codes over finite fields. In this paper, we design lattice codes from Construction A lattices where the underlying linear codes are non-binary irregular repeat-accumulate (IRA) codes. Most importantly, our codes are based on multi-dimensional lattice partitions with finite constellations. We propose a novel encoding structure that "},"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":"1710.01475","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-10-04T06:30:10Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"ba53846f9aaea7cd7165c90295e4297078e797fee8991bf0cff49d90755c4869","abstract_canon_sha256":"6030a108c090391e3150d80780ece2a6902cf802629967fc024bc13b7b9c34da"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:33:42.659570Z","signature_b64":"+gatkavWAIhuMYLYTVDwZhXlQ6aUDoYEu7hUCOkp+PodRFNmls87lxugBiRzYFC2uOg2OrruUAxSH6KQIEkiAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f008804687dade1a739153e2591e5a07d18189a163192a2ee878d50f36d0263b","last_reissued_at":"2026-05-18T00:33:42.658873Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:33:42.658873Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Design of Multi-Dimensional Irregular Repeat-Accumulate Lattice Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jinhong Yuan, Lei Yang, Min Qiu, Yixuan Xie","submitted_at":"2017-10-04T06:30:10Z","abstract_excerpt":"Most multi-dimensional (more than two dimensions) lattice partitions only form additive quotient groups and lack multiplication operations. This prevents us from constructing lattice codes based on multi-dimensional lattice partitions directly from non-binary linear codes over finite fields. In this paper, we design lattice codes from Construction A lattices where the underlying linear codes are non-binary irregular repeat-accumulate (IRA) codes. Most importantly, our codes are based on multi-dimensional lattice partitions with finite constellations. We propose a novel encoding structure that "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.01475","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":"1710.01475","created_at":"2026-05-18T00:33:42.658977+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.01475v1","created_at":"2026-05-18T00:33:42.658977+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.01475","created_at":"2026-05-18T00:33:42.658977+00:00"},{"alias_kind":"pith_short_12","alias_value":"6AEIARUH3LPB","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_16","alias_value":"6AEIARUH3LPBU44R","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_8","alias_value":"6AEIARUH","created_at":"2026-05-18T12:31:03.183658+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/6AEIARUH3LPBU44RKPRFSHS2A7","json":"https://pith.science/pith/6AEIARUH3LPBU44RKPRFSHS2A7.json","graph_json":"https://pith.science/api/pith-number/6AEIARUH3LPBU44RKPRFSHS2A7/graph.json","events_json":"https://pith.science/api/pith-number/6AEIARUH3LPBU44RKPRFSHS2A7/events.json","paper":"https://pith.science/paper/6AEIARUH"},"agent_actions":{"view_html":"https://pith.science/pith/6AEIARUH3LPBU44RKPRFSHS2A7","download_json":"https://pith.science/pith/6AEIARUH3LPBU44RKPRFSHS2A7.json","view_paper":"https://pith.science/paper/6AEIARUH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.01475&json=true","fetch_graph":"https://pith.science/api/pith-number/6AEIARUH3LPBU44RKPRFSHS2A7/graph.json","fetch_events":"https://pith.science/api/pith-number/6AEIARUH3LPBU44RKPRFSHS2A7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6AEIARUH3LPBU44RKPRFSHS2A7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6AEIARUH3LPBU44RKPRFSHS2A7/action/storage_attestation","attest_author":"https://pith.science/pith/6AEIARUH3LPBU44RKPRFSHS2A7/action/author_attestation","sign_citation":"https://pith.science/pith/6AEIARUH3LPBU44RKPRFSHS2A7/action/citation_signature","submit_replication":"https://pith.science/pith/6AEIARUH3LPBU44RKPRFSHS2A7/action/replication_record"}},"created_at":"2026-05-18T00:33:42.658977+00:00","updated_at":"2026-05-18T00:33:42.658977+00:00"}