{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:IIFIJES3S2OU7HIMHWTOLMLPDK","short_pith_number":"pith:IIFIJES3","schema_version":"1.0","canonical_sha256":"420a84925b969d4f9d0c3da6e5b16f1a89ea9310e048d2fdd6f4fec2bbc57adb","source":{"kind":"arxiv","id":"1611.00435","version":1},"attestation_state":"computed","paper":{"title":"Bounds for the $l_1$-distance of $q$-ary lattices obtained via Constructions D, D$^{'}$ and $\\overline{D}$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Eleonesio Strey, Sueli I. R. Costa","submitted_at":"2016-11-02T01:08:11Z","abstract_excerpt":"Lattices have been used in several problems in coding theory and cryptography. In this paper we approach $q$-ary lattices obtained via Constructions D, $\\D'$ and $\\overline{D}$. It is shown connections between Constructions D and $\\D'$. Bounds for the minimum $l_1$-distance of lattices $\\Lambda_{D}$, $\\Lambda_{D'}$ and $\\Lambda_{\\overline{D}}$ and, under certain conditions, a generator matrix for $\\Lambda_{D'}$ are presented. In addition, when the chain of codes used is closed under the zero-one addition, we derive explicit expressions for the minimum $l_1$-distances of the lattices $\\Lambda_{"},"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":"1611.00435","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-11-02T01:08:11Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b6ff199d12d3effdeb28c025996710ecca3bad2ab95efd1affa6208f11db5dc1","abstract_canon_sha256":"f20862ccc5fc6117b769779e788ea69b0d46dfcff4f1cca37a81f79bf512100b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:00:32.867338Z","signature_b64":"2s3twnhYpSLYQmhO6kr/pMs3HmmAeSMzpKyyIHO3JQLydT/Rum51KsPJNh7m5wW4Ruo6ATy7HeAxWDWoXXqBAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"420a84925b969d4f9d0c3da6e5b16f1a89ea9310e048d2fdd6f4fec2bbc57adb","last_reissued_at":"2026-05-18T01:00:32.866518Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:00:32.866518Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bounds for the $l_1$-distance of $q$-ary lattices obtained via Constructions D, D$^{'}$ and $\\overline{D}$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Eleonesio Strey, Sueli I. R. Costa","submitted_at":"2016-11-02T01:08:11Z","abstract_excerpt":"Lattices have been used in several problems in coding theory and cryptography. In this paper we approach $q$-ary lattices obtained via Constructions D, $\\D'$ and $\\overline{D}$. It is shown connections between Constructions D and $\\D'$. Bounds for the minimum $l_1$-distance of lattices $\\Lambda_{D}$, $\\Lambda_{D'}$ and $\\Lambda_{\\overline{D}}$ and, under certain conditions, a generator matrix for $\\Lambda_{D'}$ are presented. In addition, when the chain of codes used is closed under the zero-one addition, we derive explicit expressions for the minimum $l_1$-distances of the lattices $\\Lambda_{"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.00435","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":"1611.00435","created_at":"2026-05-18T01:00:32.866653+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.00435v1","created_at":"2026-05-18T01:00:32.866653+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.00435","created_at":"2026-05-18T01:00:32.866653+00:00"},{"alias_kind":"pith_short_12","alias_value":"IIFIJES3S2OU","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_16","alias_value":"IIFIJES3S2OU7HIM","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_8","alias_value":"IIFIJES3","created_at":"2026-05-18T12:30:22.444734+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/IIFIJES3S2OU7HIMHWTOLMLPDK","json":"https://pith.science/pith/IIFIJES3S2OU7HIMHWTOLMLPDK.json","graph_json":"https://pith.science/api/pith-number/IIFIJES3S2OU7HIMHWTOLMLPDK/graph.json","events_json":"https://pith.science/api/pith-number/IIFIJES3S2OU7HIMHWTOLMLPDK/events.json","paper":"https://pith.science/paper/IIFIJES3"},"agent_actions":{"view_html":"https://pith.science/pith/IIFIJES3S2OU7HIMHWTOLMLPDK","download_json":"https://pith.science/pith/IIFIJES3S2OU7HIMHWTOLMLPDK.json","view_paper":"https://pith.science/paper/IIFIJES3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.00435&json=true","fetch_graph":"https://pith.science/api/pith-number/IIFIJES3S2OU7HIMHWTOLMLPDK/graph.json","fetch_events":"https://pith.science/api/pith-number/IIFIJES3S2OU7HIMHWTOLMLPDK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IIFIJES3S2OU7HIMHWTOLMLPDK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IIFIJES3S2OU7HIMHWTOLMLPDK/action/storage_attestation","attest_author":"https://pith.science/pith/IIFIJES3S2OU7HIMHWTOLMLPDK/action/author_attestation","sign_citation":"https://pith.science/pith/IIFIJES3S2OU7HIMHWTOLMLPDK/action/citation_signature","submit_replication":"https://pith.science/pith/IIFIJES3S2OU7HIMHWTOLMLPDK/action/replication_record"}},"created_at":"2026-05-18T01:00:32.866653+00:00","updated_at":"2026-05-18T01:00:32.866653+00:00"}