{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:H7D2AGOJITIPGLH3CJURLJ7WJF","short_pith_number":"pith:H7D2AGOJ","schema_version":"1.0","canonical_sha256":"3fc7a019c944d0f32cfb126915a7f6496c6b34f4c4b829f9e57a1798dd6a6adf","source":{"kind":"arxiv","id":"1208.2361","version":2},"attestation_state":"computed","paper":{"title":"Lexicodes over Rings","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Kenza Guenda, S. Arash Sheikholeslam, T. Aaron Gulliver","submitted_at":"2012-08-11T15:38:50Z","abstract_excerpt":"In this paper, we consider the construction of linear lexicodes over finite chain rings by using a $B$-ordering over these rings and a selection criterion. % and a greedy Algorithm. As examples we give lexicodes over $\\mathbb{Z}_4$ and $\\mathbb{F}_2+u\\mathbb{F}_2$. %First, greedy algorithms are presented to construct %lexicodes using a multiplicative property. Then, greedy algorithms %are given for the case when the selection criteria is not %multiplicative such as the minimum distance constraint. It is shown that this construction produces many optimal codes over rings and also good binary co"},"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":"1208.2361","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.IT","submitted_at":"2012-08-11T15:38:50Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"c67ceb13c5ef5d861ba591c8b2f5bdfbc0421637baf1f0228116c43dfda07504","abstract_canon_sha256":"58165b1f87763d5178321e69c38dc4984dd330e2a241272edc43e0421d680f0c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:01.262458Z","signature_b64":"ugHpiEdUldoBcAGfyGyWpmEoWKXLuXtZu9WPfhBNuxnYsCG+3lkPn7r/tlPlXOe+73TIc35GnqJonb0c48T3BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3fc7a019c944d0f32cfb126915a7f6496c6b34f4c4b829f9e57a1798dd6a6adf","last_reissued_at":"2026-05-18T02:21:01.261934Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:01.261934Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lexicodes over Rings","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Kenza Guenda, S. Arash Sheikholeslam, T. Aaron Gulliver","submitted_at":"2012-08-11T15:38:50Z","abstract_excerpt":"In this paper, we consider the construction of linear lexicodes over finite chain rings by using a $B$-ordering over these rings and a selection criterion. % and a greedy Algorithm. As examples we give lexicodes over $\\mathbb{Z}_4$ and $\\mathbb{F}_2+u\\mathbb{F}_2$. %First, greedy algorithms are presented to construct %lexicodes using a multiplicative property. Then, greedy algorithms %are given for the case when the selection criteria is not %multiplicative such as the minimum distance constraint. It is shown that this construction produces many optimal codes over rings and also good binary co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.2361","kind":"arxiv","version":2},"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":"1208.2361","created_at":"2026-05-18T02:21:01.262009+00:00"},{"alias_kind":"arxiv_version","alias_value":"1208.2361v2","created_at":"2026-05-18T02:21:01.262009+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.2361","created_at":"2026-05-18T02:21:01.262009+00:00"},{"alias_kind":"pith_short_12","alias_value":"H7D2AGOJITIP","created_at":"2026-05-18T12:27:06.952714+00:00"},{"alias_kind":"pith_short_16","alias_value":"H7D2AGOJITIPGLH3","created_at":"2026-05-18T12:27:06.952714+00:00"},{"alias_kind":"pith_short_8","alias_value":"H7D2AGOJ","created_at":"2026-05-18T12:27:06.952714+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/H7D2AGOJITIPGLH3CJURLJ7WJF","json":"https://pith.science/pith/H7D2AGOJITIPGLH3CJURLJ7WJF.json","graph_json":"https://pith.science/api/pith-number/H7D2AGOJITIPGLH3CJURLJ7WJF/graph.json","events_json":"https://pith.science/api/pith-number/H7D2AGOJITIPGLH3CJURLJ7WJF/events.json","paper":"https://pith.science/paper/H7D2AGOJ"},"agent_actions":{"view_html":"https://pith.science/pith/H7D2AGOJITIPGLH3CJURLJ7WJF","download_json":"https://pith.science/pith/H7D2AGOJITIPGLH3CJURLJ7WJF.json","view_paper":"https://pith.science/paper/H7D2AGOJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1208.2361&json=true","fetch_graph":"https://pith.science/api/pith-number/H7D2AGOJITIPGLH3CJURLJ7WJF/graph.json","fetch_events":"https://pith.science/api/pith-number/H7D2AGOJITIPGLH3CJURLJ7WJF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/H7D2AGOJITIPGLH3CJURLJ7WJF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/H7D2AGOJITIPGLH3CJURLJ7WJF/action/storage_attestation","attest_author":"https://pith.science/pith/H7D2AGOJITIPGLH3CJURLJ7WJF/action/author_attestation","sign_citation":"https://pith.science/pith/H7D2AGOJITIPGLH3CJURLJ7WJF/action/citation_signature","submit_replication":"https://pith.science/pith/H7D2AGOJITIPGLH3CJURLJ7WJF/action/replication_record"}},"created_at":"2026-05-18T02:21:01.262009+00:00","updated_at":"2026-05-18T02:21:01.262009+00:00"}